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/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:53:19,456 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:53:19,459 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:53:19,475 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:53:19,475 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:53:19,476 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:53:19,478 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:53:19,481 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:53:19,482 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:53:19,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:53:19,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:53:19,487 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:53:19,488 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:53:19,489 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:53:19,490 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:53:19,493 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:53:19,495 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:53:19,505 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:53:19,507 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:53:19,511 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:53:19,513 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:53:19,515 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:53:19,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:53:19,518 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:53:19,518 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:53:19,519 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:53:19,521 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:53:19,525 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:53:19,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:53:19,527 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:53:19,527 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:53:19,528 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:53:19,528 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:53:19,529 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:53:19,530 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:53:19,531 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:53:19,531 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-18 09:53:19,553 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:53:19,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:53:19,553 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:53:19,554 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:53:19,554 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:53:19,554 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:53:19,554 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:53:19,554 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:53:19,555 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:53:19,555 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 09:53:19,555 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 09:53:19,555 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:53:19,555 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:53:19,556 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:53:19,556 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:53:19,556 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:53:19,557 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:53:19,557 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:53:19,557 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:53:19,557 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:53:19,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:53:19,558 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:53:19,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:53:19,558 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:53:19,558 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:53:19,559 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:53:19,559 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:53:19,559 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:53:19,559 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:53:19,559 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:53:19,560 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:53:19,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:53:19,560 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:53:19,560 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:53:19,560 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:53:19,561 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:53:19,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:53:19,561 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:53:19,561 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:53:19,596 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:53:19,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:53:19,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:53:19,610 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:53:19,611 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:53:19,611 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-02-18 09:53:19,612 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-02-18 09:53:19,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:53:19,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:53:19,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:53:19,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:53:19,643 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:53:19,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... [2019-02-18 09:53:19,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... [2019-02-18 09:53:19,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:53:19,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:53:19,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:53:19,678 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:53:19,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... [2019-02-18 09:53:19,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... [2019-02-18 09:53:19,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... [2019-02-18 09:53:19,692 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... [2019-02-18 09:53:19,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... [2019-02-18 09:53:19,699 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... [2019-02-18 09:53:19,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... [2019-02-18 09:53:19,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:53:19,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:53:19,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:53:19,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:53:19,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:53:19,767 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-02-18 09:53:19,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 09:53:19,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 09:53:19,997 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 09:53:19,998 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-18 09:53:19,999 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:53:19 BoogieIcfgContainer [2019-02-18 09:53:19,999 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:53:20,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:53:20,000 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:53:20,003 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:53:20,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:53:19" (1/2) ... [2019-02-18 09:53:20,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af4a57 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:53:20, skipping insertion in model container [2019-02-18 09:53:20,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:53:19" (2/2) ... [2019-02-18 09:53:20,007 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-02-18 09:53:20,017 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:53:20,025 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:53:20,042 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:53:20,074 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:53:20,074 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:53:20,074 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:53:20,075 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:53:20,075 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:53:20,075 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:53:20,075 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:53:20,075 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:53:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-02-18 09:53:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 09:53:20,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:20,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 09:53:20,113 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:20,125 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-02-18 09:53:20,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:20,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:20,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:20,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:20,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:53:20,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:53:20,373 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:53:20,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:53:20,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:53:20,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:53:20,395 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-02-18 09:53:20,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:20,564 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-02-18 09:53:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:53:20,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-02-18 09:53:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:20,579 INFO L225 Difference]: With dead ends: 26 [2019-02-18 09:53:20,579 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:53:20,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:53:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:53:20,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-02-18 09:53:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-18 09:53:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-02-18 09:53:20,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-02-18 09:53:20,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:20,619 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-02-18 09:53:20,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:53:20,620 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-02-18 09:53:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:53:20,620 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:20,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:53:20,621 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:20,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:20,622 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-02-18 09:53:20,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:20,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:20,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:20,624 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:20,776 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-18 09:53:20,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:53:20,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-02-18 09:53:20,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:53:20,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:53:20,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:53:20,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:53:20,780 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-02-18 09:53:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:20,906 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-02-18 09:53:20,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 09:53:20,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-02-18 09:53:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:20,908 INFO L225 Difference]: With dead ends: 25 [2019-02-18 09:53:20,908 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:53:20,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-18 09:53:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:53:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-02-18 09:53:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-18 09:53:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-02-18 09:53:20,915 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-02-18 09:53:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:20,915 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-02-18 09:53:20,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:53:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-02-18 09:53:20,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:53:20,927 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:20,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:53:20,928 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:20,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:20,928 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-02-18 09:53:20,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:20,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:20,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:20,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 09:53:20,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:53:20,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 09:53:20,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:53:20,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 09:53:20,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 09:53:20,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 09:53:20,969 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-02-18 09:53:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:21,022 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-02-18 09:53:21,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 09:53:21,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-02-18 09:53:21,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:21,023 INFO L225 Difference]: With dead ends: 24 [2019-02-18 09:53:21,023 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:53:21,024 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-18 09:53:21,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:53:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-18 09:53:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:53:21,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-02-18 09:53:21,027 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-02-18 09:53:21,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:21,027 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-02-18 09:53:21,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 09:53:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-02-18 09:53:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:53:21,028 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:21,028 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:53:21,028 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-02-18 09:53:21,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:21,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:21,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:21,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:21,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:21,359 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-02-18 09:53:21,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:21,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:21,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:21,411 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 09:53:21,413 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-02-18 09:53:21,475 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:53:21,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:53:21,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:53:21,679 INFO L272 AbstractInterpreter]: Visited 9 different actions 46 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:53:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:21,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:53:21,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:21,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:21,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:21,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:21,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:21,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:21,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:21,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-02-18 09:53:21,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:21,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-18 09:53:21,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-18 09:53:21,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-02-18 09:53:21,915 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-02-18 09:53:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:22,146 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-02-18 09:53:22,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:53:22,147 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-02-18 09:53:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:22,148 INFO L225 Difference]: With dead ends: 26 [2019-02-18 09:53:22,149 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:53:22,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-18 09:53:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:53:22,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-02-18 09:53:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 09:53:22,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-02-18 09:53:22,153 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-02-18 09:53:22,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:22,154 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-02-18 09:53:22,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-18 09:53:22,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-02-18 09:53:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-18 09:53:22,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:22,155 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:53:22,155 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:22,156 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-02-18 09:53:22,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:22,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:22,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:22,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-02-18 09:53:22,205 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-02-18 09:53:22,209 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:53:22,209 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:53:22,352 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:53:22,352 INFO L272 AbstractInterpreter]: Visited 12 different actions 96 times. Merged at 11 different actions 70 times. Widened at 3 different actions 7 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-18 09:53:22,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:22,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:53:22,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:22,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:22,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:22,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:22,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:22,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:22,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:22,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:22,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-02-18 09:53:22,540 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:22,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 09:53:22,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 09:53:22,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-02-18 09:53:22,541 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-02-18 09:53:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:22,926 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-02-18 09:53:22,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:53:22,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-02-18 09:53:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:22,928 INFO L225 Difference]: With dead ends: 31 [2019-02-18 09:53:22,929 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:53:22,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-18 09:53:22,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:53:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-02-18 09:53:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 09:53:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-02-18 09:53:22,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-02-18 09:53:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:22,934 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-02-18 09:53:22,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 09:53:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-02-18 09:53:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-18 09:53:22,935 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:22,935 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 09:53:22,936 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-02-18 09:53:22,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:22,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:22,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:22,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:23,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:23,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:23,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:23,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:23,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:23,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:23,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:23,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:23,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:53:23,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:23,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:23,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:23,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:23,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:23,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-02-18 09:53:23,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:23,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:53:23,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:53:23,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:53:23,426 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-02-18 09:53:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:23,728 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-02-18 09:53:23,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:53:23,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-02-18 09:53:23,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:23,730 INFO L225 Difference]: With dead ends: 35 [2019-02-18 09:53:23,731 INFO L226 Difference]: Without dead ends: 28 [2019-02-18 09:53:23,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-02-18 09:53:23,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-18 09:53:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-02-18 09:53:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-18 09:53:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-02-18 09:53:23,737 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-02-18 09:53:23,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:23,737 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-02-18 09:53:23,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:53:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-02-18 09:53:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-18 09:53:23,738 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:23,738 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-18 09:53:23,739 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-02-18 09:53:23,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:23,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:23,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:23,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:23,853 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:23,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:23,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:23,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:23,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:23,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:23,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:23,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:23,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:23,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:23,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:23,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:23,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:23,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:23,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-02-18 09:53:23,972 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:23,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:53:23,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:53:23,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-02-18 09:53:23,974 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-02-18 09:53:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:24,092 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-02-18 09:53:24,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:53:24,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-02-18 09:53:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:24,093 INFO L225 Difference]: With dead ends: 45 [2019-02-18 09:53:24,093 INFO L226 Difference]: Without dead ends: 26 [2019-02-18 09:53:24,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:53:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-18 09:53:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-02-18 09:53:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 09:53:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-02-18 09:53:24,098 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-02-18 09:53:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:24,098 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-02-18 09:53:24,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:53:24,099 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-02-18 09:53:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-18 09:53:24,099 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:24,100 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-02-18 09:53:24,100 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:24,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-02-18 09:53:24,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:24,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:24,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:24,410 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:24,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:24,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:24,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:24,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:24,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:24,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:24,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:24,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:24,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:24,549 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:24,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:24,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:24,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-02-18 09:53:24,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:24,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:53:24,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:53:24,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:53:24,604 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-02-18 09:53:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:24,960 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-02-18 09:53:24,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:53:24,961 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-02-18 09:53:24,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:24,962 INFO L225 Difference]: With dead ends: 49 [2019-02-18 09:53:24,962 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:53:24,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-02-18 09:53:24,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:53:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-02-18 09:53:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 09:53:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-02-18 09:53:24,968 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-02-18 09:53:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:24,969 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-02-18 09:53:24,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:53:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-02-18 09:53:24,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-18 09:53:24,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:24,970 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-18 09:53:24,970 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:24,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-02-18 09:53:24,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:24,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:24,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:25,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:25,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:25,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:25,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:25,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:25,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:25,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 09:53:25,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:25,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:25,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:25,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:25,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-02-18 09:53:25,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:25,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 09:53:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 09:53:25,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-02-18 09:53:25,235 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-02-18 09:53:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:25,818 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-02-18 09:53:25,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:53:25,818 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-02-18 09:53:25,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:25,820 INFO L225 Difference]: With dead ends: 60 [2019-02-18 09:53:25,820 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:53:25,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-02-18 09:53:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:53:25,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-02-18 09:53:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-18 09:53:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-02-18 09:53:25,826 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-02-18 09:53:25,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:25,826 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-02-18 09:53:25,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 09:53:25,827 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-02-18 09:53:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-18 09:53:25,827 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:25,827 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-02-18 09:53:25,827 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:25,828 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-02-18 09:53:25,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:25,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:25,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:25,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:25,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:26,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:26,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:26,093 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:26,093 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:26,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:26,093 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:26,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:26,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:26,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:26,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:26,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:26,267 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:26,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:26,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:26,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-02-18 09:53:26,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:26,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:53:26,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:53:26,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:53:26,326 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-02-18 09:53:26,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:26,782 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-02-18 09:53:26,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:53:26,786 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-02-18 09:53:26,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:26,787 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:53:26,787 INFO L226 Difference]: Without dead ends: 50 [2019-02-18 09:53:26,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-02-18 09:53:26,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-18 09:53:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-02-18 09:53:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-18 09:53:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-02-18 09:53:26,799 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-02-18 09:53:26,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:26,800 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-02-18 09:53:26,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:53:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-02-18 09:53:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-18 09:53:26,801 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:26,801 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-18 09:53:26,801 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:26,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-02-18 09:53:26,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:26,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:26,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:27,285 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:27,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:27,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:27,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:27,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:27,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:27,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:27,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:27,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:27,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:27,433 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:27,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:27,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:27,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-02-18 09:53:27,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:27,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:53:27,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:53:27,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-02-18 09:53:27,596 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-02-18 09:53:27,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:27,897 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-02-18 09:53:27,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:53:27,897 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-02-18 09:53:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:27,898 INFO L225 Difference]: With dead ends: 75 [2019-02-18 09:53:27,899 INFO L226 Difference]: Without dead ends: 40 [2019-02-18 09:53:27,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:53:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-18 09:53:27,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-02-18 09:53:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:53:27,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-02-18 09:53:27,906 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-02-18 09:53:27,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:27,907 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-02-18 09:53:27,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:53:27,907 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-02-18 09:53:27,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-18 09:53:27,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:27,908 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-02-18 09:53:27,908 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:27,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-02-18 09:53:27,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:27,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:27,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:27,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:28,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:28,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:28,207 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:28,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:28,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:28,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:28,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:28,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:28,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-18 09:53:28,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:28,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:28,666 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:28,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:29,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:29,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-02-18 09:53:29,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:29,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-18 09:53:29,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-18 09:53:29,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:53:29,461 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-02-18 09:53:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:31,461 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-02-18 09:53:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:53:31,461 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-02-18 09:53:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:31,462 INFO L225 Difference]: With dead ends: 97 [2019-02-18 09:53:31,462 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 09:53:31,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:53:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 09:53:31,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-02-18 09:53:31,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-18 09:53:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-02-18 09:53:31,472 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-02-18 09:53:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:31,472 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-02-18 09:53:31,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-18 09:53:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-02-18 09:53:31,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-18 09:53:31,474 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:31,474 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-02-18 09:53:31,474 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:31,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-02-18 09:53:31,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:31,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:31,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:31,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:31,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:31,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:31,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:31,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:31,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:31,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:31,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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:31,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:31,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:31,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:31,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:31,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:32,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:32,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:32,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-02-18 09:53:32,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:32,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:53:32,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:53:32,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:53:32,225 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-02-18 09:53:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:33,507 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-02-18 09:53:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:53:33,508 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-02-18 09:53:33,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:33,509 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:53:33,510 INFO L226 Difference]: Without dead ends: 72 [2019-02-18 09:53:33,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-02-18 09:53:33,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-18 09:53:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-02-18 09:53:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-18 09:53:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-02-18 09:53:33,521 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-02-18 09:53:33,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:33,521 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-02-18 09:53:33,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:53:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-02-18 09:53:33,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-18 09:53:33,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:33,523 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-18 09:53:33,523 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:33,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:33,523 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-02-18 09:53:33,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:33,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:33,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:33,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:33,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:33,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:33,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:33,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:33,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:33,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:33,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:33,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:33,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:33,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:33,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:34,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:34,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-02-18 09:53:34,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:34,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:53:34,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:53:34,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-02-18 09:53:34,068 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-02-18 09:53:34,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:34,363 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-02-18 09:53:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:53:34,364 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-02-18 09:53:34,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:34,365 INFO L225 Difference]: With dead ends: 105 [2019-02-18 09:53:34,365 INFO L226 Difference]: Without dead ends: 54 [2019-02-18 09:53:34,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-02-18 09:53:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-18 09:53:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-02-18 09:53:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-18 09:53:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-02-18 09:53:34,375 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-02-18 09:53:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:34,375 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-02-18 09:53:34,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:53:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-02-18 09:53:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-18 09:53:34,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:34,376 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-02-18 09:53:34,376 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-02-18 09:53:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:34,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:34,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:34,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:34,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:34,756 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:34,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:34,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:34,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:34,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:34,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:34,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:34,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:34,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:34,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-18 09:53:34,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:34,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:35,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:35,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:35,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-02-18 09:53:35,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:35,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:53:35,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:53:35,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:53:35,096 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-02-18 09:53:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:36,499 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-02-18 09:53:36,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:53:36,499 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-02-18 09:53:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:36,500 INFO L225 Difference]: With dead ends: 109 [2019-02-18 09:53:36,500 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:53:36,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:53:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:53:36,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-02-18 09:53:36,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-18 09:53:36,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-02-18 09:53:36,510 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-02-18 09:53:36,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:36,511 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-02-18 09:53:36,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:53:36,511 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-02-18 09:53:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-18 09:53:36,512 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:36,512 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-18 09:53:36,512 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:36,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:36,512 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-02-18 09:53:36,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:36,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:36,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:36,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:36,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:36,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:36,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:36,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:36,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:36,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:36,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:36,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:36,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:36,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:36,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:36,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:36,882 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:36,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:36,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:36,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-02-18 09:53:36,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:36,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-18 09:53:36,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-18 09:53:36,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-02-18 09:53:36,995 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-02-18 09:53:37,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:37,338 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-02-18 09:53:37,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:53:37,339 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-02-18 09:53:37,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:37,339 INFO L225 Difference]: With dead ends: 120 [2019-02-18 09:53:37,340 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:53:37,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:53:37,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:53:37,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-02-18 09:53:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-18 09:53:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-02-18 09:53:37,351 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-02-18 09:53:37,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:37,351 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-02-18 09:53:37,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-18 09:53:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-02-18 09:53:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-18 09:53:37,353 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:37,353 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-02-18 09:53:37,353 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:37,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-02-18 09:53:37,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:37,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:37,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:37,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:37,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:37,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:38,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:38,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:38,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:38,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:38,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:38,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:38,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:38,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:38,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:38,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:38,478 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:38,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:38,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-02-18 09:53:38,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:38,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:53:38,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:53:38,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-02-18 09:53:38,498 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-02-18 09:53:39,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:39,965 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-02-18 09:53:39,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:53:39,968 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-02-18 09:53:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:39,969 INFO L225 Difference]: With dead ends: 124 [2019-02-18 09:53:39,969 INFO L226 Difference]: Without dead ends: 94 [2019-02-18 09:53:39,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-02-18 09:53:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-18 09:53:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-02-18 09:53:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-18 09:53:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-02-18 09:53:39,979 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-02-18 09:53:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:39,980 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-02-18 09:53:39,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:53:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-02-18 09:53:39,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-18 09:53:39,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:39,981 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-18 09:53:39,981 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:39,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-02-18 09:53:39,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:39,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:39,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:39,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:39,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:40,219 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:40,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:40,219 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:40,220 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:40,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:40,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:40,220 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:40,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:40,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:40,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-18 09:53:40,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:40,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:40,515 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:40,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:40,660 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:40,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:40,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-02-18 09:53:40,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:40,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:53:40,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:53:40,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-02-18 09:53:40,681 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-02-18 09:53:41,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:41,257 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-02-18 09:53:41,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:53:41,257 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-02-18 09:53:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:41,258 INFO L225 Difference]: With dead ends: 135 [2019-02-18 09:53:41,258 INFO L226 Difference]: Without dead ends: 68 [2019-02-18 09:53:41,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:53:41,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-18 09:53:41,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-02-18 09:53:41,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 09:53:41,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-02-18 09:53:41,280 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-02-18 09:53:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:41,280 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-02-18 09:53:41,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:53:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-02-18 09:53:41,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-18 09:53:41,281 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:41,281 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-02-18 09:53:41,282 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:41,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:41,285 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-02-18 09:53:41,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:41,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:41,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:41,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:41,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:41,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:41,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:41,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:41,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:41,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:41,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:41,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:41,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:41,759 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:41,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:41,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:42,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:42,145 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:42,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:42,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-02-18 09:53:42,169 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:42,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:53:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:53:42,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:53:42,170 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-02-18 09:53:44,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:44,227 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-02-18 09:53:44,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:53:44,228 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-02-18 09:53:44,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:44,228 INFO L225 Difference]: With dead ends: 139 [2019-02-18 09:53:44,229 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:53:44,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:53:44,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:53:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-02-18 09:53:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-18 09:53:44,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-02-18 09:53:44,238 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-02-18 09:53:44,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:44,239 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-02-18 09:53:44,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:53:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-02-18 09:53:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-18 09:53:44,240 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:44,240 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-18 09:53:44,240 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:44,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:44,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-02-18 09:53:44,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:44,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:44,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:44,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:44,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:44,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:44,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:44,769 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:44,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:44,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:44,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:44,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:44,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:44,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:44,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:45,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:45,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:45,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-02-18 09:53:45,630 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:45,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-18 09:53:45,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-18 09:53:45,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-02-18 09:53:45,631 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-02-18 09:53:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:46,013 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-02-18 09:53:46,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:53:46,014 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-02-18 09:53:46,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:46,014 INFO L225 Difference]: With dead ends: 150 [2019-02-18 09:53:46,015 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:53:46,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-02-18 09:53:46,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:53:46,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-02-18 09:53:46,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-18 09:53:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-02-18 09:53:46,026 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-02-18 09:53:46,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:46,026 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-02-18 09:53:46,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-18 09:53:46,026 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-02-18 09:53:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-18 09:53:46,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:46,027 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-02-18 09:53:46,027 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:46,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-02-18 09:53:46,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:46,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:46,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:46,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:46,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:46,521 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:46,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:46,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:46,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:46,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:46,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:46,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:46,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:46,530 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:46,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-18 09:53:46,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:46,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:47,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:48,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:48,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-02-18 09:53:48,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:48,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:53:48,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:53:48,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:53:48,434 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-02-18 09:53:50,954 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-02-18 09:53:52,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:52,885 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-02-18 09:53:52,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 09:53:52,885 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-02-18 09:53:52,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:52,886 INFO L225 Difference]: With dead ends: 192 [2019-02-18 09:53:52,886 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 09:53:52,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 09:53:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 09:53:52,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-02-18 09:53:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-18 09:53:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-02-18 09:53:52,901 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-02-18 09:53:52,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:52,901 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-02-18 09:53:52,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:53:52,901 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-02-18 09:53:52,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-18 09:53:52,902 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:52,902 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-02-18 09:53:52,902 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:52,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:52,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-02-18 09:53:52,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:52,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:52,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:52,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:52,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:53,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:53,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:53,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:53,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:53,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:53,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:53,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:53,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:53,690 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:53,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:53,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:54,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:54,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:54,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-02-18 09:53:54,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:54,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:53:54,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:53:54,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:53:54,359 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-02-18 09:53:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:56,530 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-02-18 09:53:56,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:53:56,534 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-02-18 09:53:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:56,535 INFO L225 Difference]: With dead ends: 169 [2019-02-18 09:53:56,535 INFO L226 Difference]: Without dead ends: 127 [2019-02-18 09:53:56,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-02-18 09:53:56,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-18 09:53:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-02-18 09:53:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 09:53:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-02-18 09:53:56,546 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-02-18 09:53:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:56,546 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-02-18 09:53:56,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:53:56,547 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-02-18 09:53:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-18 09:53:56,547 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:56,547 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-18 09:53:56,548 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-02-18 09:53:56,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:56,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:56,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:56,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:56,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:57,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:57,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:57,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:57,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:57,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:57,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:57,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:57,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:57,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:57,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:57,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:58,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:58,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-02-18 09:53:58,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:58,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-18 09:53:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-18 09:53:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-02-18 09:53:58,081 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-02-18 09:53:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:58,823 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-02-18 09:53:58,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:53:58,823 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-02-18 09:53:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:58,824 INFO L225 Difference]: With dead ends: 180 [2019-02-18 09:53:58,824 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:53:58,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:53:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:53:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-02-18 09:53:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-18 09:53:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-02-18 09:53:58,835 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-02-18 09:53:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:58,835 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-02-18 09:53:58,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-18 09:53:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-02-18 09:53:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-18 09:53:58,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:58,836 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-02-18 09:53:58,836 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:58,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-02-18 09:53:58,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:58,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:58,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:58,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:59,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:59,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:59,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:59,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:59,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:59,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:59,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:59,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:59,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-18 09:53:59,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:59,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:00,585 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:00,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:01,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:01,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-02-18 09:54:01,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:01,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-18 09:54:01,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-18 09:54:01,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-02-18 09:54:01,558 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-02-18 09:54:06,746 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-02-18 09:54:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:07,972 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-02-18 09:54:07,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-18 09:54:07,973 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-02-18 09:54:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:07,974 INFO L225 Difference]: With dead ends: 230 [2019-02-18 09:54:07,975 INFO L226 Difference]: Without dead ends: 135 [2019-02-18 09:54:07,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-02-18 09:54:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-18 09:54:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-02-18 09:54:07,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-18 09:54:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-02-18 09:54:07,990 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-02-18 09:54:07,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:07,990 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-02-18 09:54:07,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-18 09:54:07,990 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-02-18 09:54:07,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-18 09:54:07,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:08,000 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-02-18 09:54:08,001 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:08,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:08,001 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-02-18 09:54:08,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:08,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:08,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:08,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:08,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:08,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:08,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:08,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:08,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:08,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:08,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:08,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:08,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:08,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:08,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:08,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:09,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:09,500 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:09,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:09,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-02-18 09:54:09,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:09,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:54:09,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:54:09,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:54:09,520 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-02-18 09:54:12,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:12,634 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-02-18 09:54:12,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:54:12,634 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-02-18 09:54:12,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:12,636 INFO L225 Difference]: With dead ends: 199 [2019-02-18 09:54:12,636 INFO L226 Difference]: Without dead ends: 149 [2019-02-18 09:54:12,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:54:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-18 09:54:12,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-02-18 09:54:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-18 09:54:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-02-18 09:54:12,650 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-02-18 09:54:12,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:12,650 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-02-18 09:54:12,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:54:12,650 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-02-18 09:54:12,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-18 09:54:12,651 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:12,651 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-18 09:54:12,651 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:12,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:12,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-02-18 09:54:12,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:12,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:12,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:12,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:12,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:13,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:13,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:13,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:13,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:13,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:13,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:13,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:13,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:13,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:13,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:14,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:14,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-02-18 09:54:14,172 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:14,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-18 09:54:14,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-18 09:54:14,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-02-18 09:54:14,174 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-02-18 09:54:14,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:14,826 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-02-18 09:54:14,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:54:14,826 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-02-18 09:54:14,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:14,827 INFO L225 Difference]: With dead ends: 210 [2019-02-18 09:54:14,827 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:54:14,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:54:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:54:14,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-02-18 09:54:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-18 09:54:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-02-18 09:54:14,843 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-02-18 09:54:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:14,843 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-02-18 09:54:14,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-18 09:54:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-02-18 09:54:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-18 09:54:14,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:14,843 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-02-18 09:54:14,844 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:14,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:14,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-02-18 09:54:14,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:14,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:14,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:14,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:14,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:15,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:15,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:15,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:15,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:15,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:15,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:15,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:15,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:15,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-18 09:54:15,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:15,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:16,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:16,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:16,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-02-18 09:54:16,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:16,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:54:16,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:54:16,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-02-18 09:54:16,320 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-02-18 09:54:18,979 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-02-18 09:54:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:19,975 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-02-18 09:54:19,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 09:54:19,976 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-02-18 09:54:19,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:19,977 INFO L225 Difference]: With dead ends: 214 [2019-02-18 09:54:19,977 INFO L226 Difference]: Without dead ends: 160 [2019-02-18 09:54:19,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-02-18 09:54:19,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-02-18 09:54:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-02-18 09:54:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-18 09:54:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-02-18 09:54:19,996 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-02-18 09:54:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:19,996 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-02-18 09:54:19,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:54:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-02-18 09:54:19,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-18 09:54:19,997 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:19,997 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-18 09:54:19,997 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:19,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:19,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-02-18 09:54:19,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:19,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:19,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:19,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:20,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:20,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:20,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:20,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:20,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:20,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:20,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:20,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:20,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:20,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:20,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:20,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:21,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:21,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-02-18 09:54:21,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:21,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:54:21,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:54:21,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-02-18 09:54:21,125 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-02-18 09:54:21,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:21,722 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-02-18 09:54:21,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:54:21,722 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-02-18 09:54:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:21,723 INFO L225 Difference]: With dead ends: 225 [2019-02-18 09:54:21,723 INFO L226 Difference]: Without dead ends: 110 [2019-02-18 09:54:21,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-02-18 09:54:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-18 09:54:21,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-02-18 09:54:21,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-18 09:54:21,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-02-18 09:54:21,743 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-02-18 09:54:21,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:21,743 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-02-18 09:54:21,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:54:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-02-18 09:54:21,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-18 09:54:21,744 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:21,744 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-02-18 09:54:21,745 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:21,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-02-18 09:54:21,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:21,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:21,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:21,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:22,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:22,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:22,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:22,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:22,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:22,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:22,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:22,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:22,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:23,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:23,394 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:23,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:23,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-02-18 09:54:23,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:23,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:54:23,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:54:23,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:54:23,413 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-02-18 09:54:28,069 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-02-18 09:54:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:28,383 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-02-18 09:54:28,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 09:54:28,383 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-02-18 09:54:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:28,385 INFO L225 Difference]: With dead ends: 229 [2019-02-18 09:54:28,385 INFO L226 Difference]: Without dead ends: 171 [2019-02-18 09:54:28,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:54:28,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-02-18 09:54:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-02-18 09:54:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-18 09:54:28,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-02-18 09:54:28,410 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-02-18 09:54:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:28,410 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-02-18 09:54:28,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:54:28,410 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-02-18 09:54:28,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-18 09:54:28,411 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:28,411 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-18 09:54:28,411 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:28,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:28,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-02-18 09:54:28,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:28,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:28,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:28,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:28,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:28,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:28,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:28,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:28,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:28,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:28,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:28,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:28,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:28,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-18 09:54:28,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:28,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:29,615 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:29,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:29,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:29,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-02-18 09:54:29,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:29,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-18 09:54:29,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-18 09:54:29,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-02-18 09:54:29,936 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-02-18 09:54:30,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:30,452 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-02-18 09:54:30,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:54:30,453 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-02-18 09:54:30,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:30,453 INFO L225 Difference]: With dead ends: 240 [2019-02-18 09:54:30,454 INFO L226 Difference]: Without dead ends: 117 [2019-02-18 09:54:30,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-02-18 09:54:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-18 09:54:30,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-02-18 09:54:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-18 09:54:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-02-18 09:54:30,471 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-02-18 09:54:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:30,472 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-02-18 09:54:30,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-18 09:54:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-02-18 09:54:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-18 09:54:30,472 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:30,473 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-02-18 09:54:30,473 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:30,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-02-18 09:54:30,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:30,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:30,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:30,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:30,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:31,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:31,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:31,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:31,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:31,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:31,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:31,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:31,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:31,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:31,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:31,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:32,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:32,906 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:32,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:32,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-02-18 09:54:32,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:32,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:54:32,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:54:32,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-02-18 09:54:32,926 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-02-18 09:54:38,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:38,236 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-02-18 09:54:38,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 09:54:38,236 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-02-18 09:54:38,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:38,238 INFO L225 Difference]: With dead ends: 244 [2019-02-18 09:54:38,238 INFO L226 Difference]: Without dead ends: 182 [2019-02-18 09:54:38,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-02-18 09:54:38,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-18 09:54:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-02-18 09:54:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-02-18 09:54:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-02-18 09:54:38,261 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-02-18 09:54:38,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:38,262 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-02-18 09:54:38,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:54:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-02-18 09:54:38,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-02-18 09:54:38,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:38,263 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-18 09:54:38,263 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:38,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:38,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-02-18 09:54:38,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:38,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:38,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:38,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:38,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:38,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:38,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:38,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:38,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:38,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:38,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:38,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:38,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:38,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:39,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:39,896 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:39,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:39,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-02-18 09:54:39,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:39,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:54:39,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:54:39,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-02-18 09:54:39,916 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-02-18 09:54:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:40,827 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-02-18 09:54:40,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:54:40,828 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-02-18 09:54:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:40,829 INFO L225 Difference]: With dead ends: 255 [2019-02-18 09:54:40,829 INFO L226 Difference]: Without dead ends: 124 [2019-02-18 09:54:40,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:54:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-02-18 09:54:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-02-18 09:54:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-18 09:54:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-02-18 09:54:40,847 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-02-18 09:54:40,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:40,847 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-02-18 09:54:40,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:54:40,847 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-02-18 09:54:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-18 09:54:40,848 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:40,848 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-02-18 09:54:40,848 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:40,848 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-02-18 09:54:40,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:40,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:40,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:40,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:40,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:41,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:41,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:41,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:41,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:41,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:41,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:41,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:41,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:41,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-18 09:54:41,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:41,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:43,869 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:43,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:45,877 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:45,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:45,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-02-18 09:54:45,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:45,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-18 09:54:45,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-18 09:54:45,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:54:45,898 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-02-18 09:54:54,803 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-02-18 09:54:56,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:56,082 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-02-18 09:54:56,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-02-18 09:54:56,082 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-02-18 09:54:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:56,084 INFO L225 Difference]: With dead ends: 325 [2019-02-18 09:54:56,084 INFO L226 Difference]: Without dead ends: 190 [2019-02-18 09:54:56,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 09:54:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-02-18 09:54:56,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-02-18 09:54:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-02-18 09:54:56,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-02-18 09:54:56,104 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-02-18 09:54:56,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:56,104 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-02-18 09:54:56,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-18 09:54:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-02-18 09:54:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-02-18 09:54:56,105 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:56,105 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-02-18 09:54:56,105 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:56,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:56,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-02-18 09:54:56,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:56,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:56,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:56,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:56,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:57,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:57,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:57,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:57,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:57,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:57,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:57,962 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:57,962 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:57,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:57,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:57,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:58,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:58,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:59,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:59,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-02-18 09:54:59,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:59,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:54:59,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:54:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:54:59,026 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-02-18 09:55:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:04,732 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-02-18 09:55:04,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-18 09:55:04,733 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-02-18 09:55:04,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:04,734 INFO L225 Difference]: With dead ends: 274 [2019-02-18 09:55:04,734 INFO L226 Difference]: Without dead ends: 204 [2019-02-18 09:55:04,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:55:04,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-02-18 09:55:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-02-18 09:55:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-18 09:55:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-02-18 09:55:04,767 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-02-18 09:55:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:04,767 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-02-18 09:55:04,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:55:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-02-18 09:55:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-18 09:55:04,768 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:04,768 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-18 09:55:04,768 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-02-18 09:55:04,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:04,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:04,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:04,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:04,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:05,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:05,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:05,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:05,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:05,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:05,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:05,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:05,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:55:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:05,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:06,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:06,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:06,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:06,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-02-18 09:55:06,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:06,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:55:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:55:06,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-02-18 09:55:06,912 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-02-18 09:55:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:07,802 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-02-18 09:55:07,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:55:07,802 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-02-18 09:55:07,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:07,804 INFO L225 Difference]: With dead ends: 285 [2019-02-18 09:55:07,804 INFO L226 Difference]: Without dead ends: 138 [2019-02-18 09:55:07,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-02-18 09:55:07,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-02-18 09:55:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-02-18 09:55:07,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-18 09:55:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-02-18 09:55:07,827 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-02-18 09:55:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:07,827 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-02-18 09:55:07,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:55:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-02-18 09:55:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-18 09:55:07,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:07,828 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-02-18 09:55:07,829 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-02-18 09:55:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:07,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:07,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:08,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:08,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:08,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:08,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:08,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:08,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:08,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:08,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:08,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:08,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-18 09:55:08,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:08,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:11,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:13,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:13,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-02-18 09:55:13,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:13,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-18 09:55:13,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-18 09:55:13,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-02-18 09:55:13,707 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-02-18 09:55:24,578 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-18 09:55:24,863 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-18 09:55:25,435 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-18 09:55:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:27,453 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-02-18 09:55:27,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-02-18 09:55:27,454 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-02-18 09:55:27,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:27,456 INFO L225 Difference]: With dead ends: 363 [2019-02-18 09:55:27,456 INFO L226 Difference]: Without dead ends: 212 [2019-02-18 09:55:27,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-02-18 09:55:27,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-18 09:55:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-02-18 09:55:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-02-18 09:55:27,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-02-18 09:55:27,480 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-02-18 09:55:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:27,480 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-02-18 09:55:27,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-18 09:55:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-02-18 09:55:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-02-18 09:55:27,481 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:27,481 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-02-18 09:55:27,481 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:27,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:27,481 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-02-18 09:55:27,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:27,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:27,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:28,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:28,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:28,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:28,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:28,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:28,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:28,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:55:28,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:55:28,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:55:28,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:28,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:30,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:30,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-02-18 09:55:30,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:30,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:55:30,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:55:30,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-02-18 09:55:30,371 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-02-18 09:55:34,618 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-18 09:55:34,880 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-18 09:55:35,142 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-02-18 09:55:35,675 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-18 09:55:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:37,110 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-02-18 09:55:37,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-18 09:55:37,110 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-02-18 09:55:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:37,112 INFO L225 Difference]: With dead ends: 304 [2019-02-18 09:55:37,112 INFO L226 Difference]: Without dead ends: 226 [2019-02-18 09:55:37,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-02-18 09:55:37,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-02-18 09:55:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-02-18 09:55:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-02-18 09:55:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-02-18 09:55:37,145 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-02-18 09:55:37,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:37,146 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-02-18 09:55:37,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:55:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-02-18 09:55:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-02-18 09:55:37,147 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:37,147 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-18 09:55:37,147 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:37,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-02-18 09:55:37,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:37,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:37,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:37,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:38,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:38,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:38,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:38,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:38,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:38,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:38,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:38,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:55:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:38,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:38,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:39,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:39,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:39,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-02-18 09:55:39,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:39,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:55:39,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:55:39,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-02-18 09:55:39,525 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-02-18 09:55:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:41,141 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-02-18 09:55:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:55:41,142 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-02-18 09:55:41,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:41,143 INFO L225 Difference]: With dead ends: 315 [2019-02-18 09:55:41,143 INFO L226 Difference]: Without dead ends: 152 [2019-02-18 09:55:41,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:55:41,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-18 09:55:41,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-02-18 09:55:41,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-02-18 09:55:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-02-18 09:55:41,166 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-02-18 09:55:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:41,166 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-02-18 09:55:41,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:55:41,166 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-02-18 09:55:41,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-02-18 09:55:41,167 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:41,167 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-02-18 09:55:41,167 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:41,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:41,167 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-02-18 09:55:41,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:41,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:41,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:42,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:42,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:42,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:42,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:42,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:42,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:42,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:42,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:42,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:42,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-18 09:55:42,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:42,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:45,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:48,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:48,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-02-18 09:55:48,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:48,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-18 09:55:48,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-18 09:55:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:55:48,392 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-02-18 09:56:00,123 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-18 09:56:00,446 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-18 09:56:00,752 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-02-18 09:56:01,013 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:56:01,308 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-18 09:56:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:03,680 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-02-18 09:56:03,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-02-18 09:56:03,681 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-02-18 09:56:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:03,682 INFO L225 Difference]: With dead ends: 401 [2019-02-18 09:56:03,683 INFO L226 Difference]: Without dead ends: 234 [2019-02-18 09:56:03,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-02-18 09:56:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-02-18 09:56:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-02-18 09:56:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-18 09:56:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-02-18 09:56:03,713 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-02-18 09:56:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:03,714 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-02-18 09:56:03,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-18 09:56:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-02-18 09:56:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-18 09:56:03,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:03,715 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-02-18 09:56:03,715 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:03,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:03,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-02-18 09:56:03,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:03,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:03,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:03,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:03,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:05,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:05,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:05,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:05,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:05,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:05,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:05,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:05,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:05,560 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:05,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:05,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:05,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:07,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:07,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:07,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-02-18 09:56:07,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:07,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:56:07,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:56:07,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-02-18 09:56:07,341 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-02-18 09:56:13,188 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-18 09:56:13,495 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-18 09:56:13,797 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-02-18 09:56:13,995 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:56:14,199 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:56:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:16,181 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-02-18 09:56:16,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-18 09:56:16,182 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-02-18 09:56:16,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:16,184 INFO L225 Difference]: With dead ends: 334 [2019-02-18 09:56:16,184 INFO L226 Difference]: Without dead ends: 248 [2019-02-18 09:56:16,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-02-18 09:56:16,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-18 09:56:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-02-18 09:56:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-02-18 09:56:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-02-18 09:56:16,223 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-02-18 09:56:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:16,223 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-02-18 09:56:16,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:56:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-02-18 09:56:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-02-18 09:56:16,224 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:16,224 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-18 09:56:16,225 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:16,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:16,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-02-18 09:56:16,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:16,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:16,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:16,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:17,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:17,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:17,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:17,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:17,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:17,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:17,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:17,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:17,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:18,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:19,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:19,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:19,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-02-18 09:56:19,092 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:19,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:56:19,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:56:19,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-02-18 09:56:19,093 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-02-18 09:56:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:20,726 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-02-18 09:56:20,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:56:20,729 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-02-18 09:56:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:20,730 INFO L225 Difference]: With dead ends: 345 [2019-02-18 09:56:20,730 INFO L226 Difference]: Without dead ends: 166 [2019-02-18 09:56:20,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:56:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-02-18 09:56:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-02-18 09:56:20,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-02-18 09:56:20,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-02-18 09:56:20,757 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-02-18 09:56:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:20,758 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-02-18 09:56:20,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:56:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-02-18 09:56:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-02-18 09:56:20,758 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:20,758 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-02-18 09:56:20,759 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:20,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:20,759 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-02-18 09:56:20,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:20,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:20,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:20,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:22,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:22,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:22,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:22,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:22,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:22,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:22,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:22,779 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:22,832 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-18 09:56:22,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:22,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:24,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:24,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:24,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-02-18 09:56:24,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:24,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:56:24,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:56:24,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:56:24,351 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-02-18 09:56:31,210 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-18 09:56:31,542 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-18 09:56:31,890 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-02-18 09:56:32,134 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:56:32,352 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:56:32,540 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:56:34,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:34,601 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-02-18 09:56:34,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-18 09:56:34,601 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-02-18 09:56:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:34,603 INFO L225 Difference]: With dead ends: 349 [2019-02-18 09:56:34,603 INFO L226 Difference]: Without dead ends: 259 [2019-02-18 09:56:34,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-02-18 09:56:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-02-18 09:56:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-02-18 09:56:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-02-18 09:56:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-02-18 09:56:34,633 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-02-18 09:56:34,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:34,633 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-02-18 09:56:34,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:56:34,633 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-02-18 09:56:34,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-02-18 09:56:34,634 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:34,634 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-18 09:56:34,634 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:34,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:34,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-02-18 09:56:34,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:34,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:34,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:35,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:35,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:35,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:35,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:35,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:35,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:35,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:35,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:35,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:35,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:35,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:36,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:36,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:37,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:37,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:37,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-02-18 09:56:37,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:37,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-18 09:56:37,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-18 09:56:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-02-18 09:56:37,524 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-02-18 09:56:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:39,263 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-02-18 09:56:39,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:56:39,263 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-02-18 09:56:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:39,265 INFO L225 Difference]: With dead ends: 360 [2019-02-18 09:56:39,265 INFO L226 Difference]: Without dead ends: 173 [2019-02-18 09:56:39,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-02-18 09:56:39,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-18 09:56:39,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-02-18 09:56:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-02-18 09:56:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-02-18 09:56:39,295 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-02-18 09:56:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:39,296 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-02-18 09:56:39,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-18 09:56:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-02-18 09:56:39,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-02-18 09:56:39,296 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:39,296 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-02-18 09:56:39,297 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:39,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-02-18 09:56:39,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:39,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:39,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:41,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:41,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:41,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:41,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:41,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:41,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:41,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:41,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:41,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:43,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:43,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:43,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:43,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-02-18 09:56:43,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:43,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:56:43,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:56:43,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-02-18 09:56:43,320 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-02-18 09:56:50,768 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-18 09:56:51,115 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-18 09:56:51,447 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-02-18 09:56:51,676 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:56:51,891 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:56:52,093 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:56:52,316 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:56:52,569 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-18 09:56:54,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:54,465 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-02-18 09:56:54,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-18 09:56:54,465 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-02-18 09:56:54,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:54,466 INFO L225 Difference]: With dead ends: 364 [2019-02-18 09:56:54,466 INFO L226 Difference]: Without dead ends: 270 [2019-02-18 09:56:54,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-02-18 09:56:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-02-18 09:56:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-02-18 09:56:54,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-18 09:56:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-02-18 09:56:54,498 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-02-18 09:56:54,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:54,498 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-02-18 09:56:54,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:56:54,498 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-02-18 09:56:54,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-18 09:56:54,499 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:54,499 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-18 09:56:54,499 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:54,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-02-18 09:56:54,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:54,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:54,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:54,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:55,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:55,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:55,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:55,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:55,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:55,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:55,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:55,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:55,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-18 09:56:55,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:55,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:57,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:57,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:58,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:58,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-02-18 09:56:58,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:58,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:56:58,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:56:58,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-02-18 09:56:58,240 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-02-18 09:57:00,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:00,067 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-02-18 09:57:00,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:57:00,067 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-02-18 09:57:00,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:00,068 INFO L225 Difference]: With dead ends: 375 [2019-02-18 09:57:00,069 INFO L226 Difference]: Without dead ends: 180 [2019-02-18 09:57:00,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-02-18 09:57:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-02-18 09:57:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-02-18 09:57:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-18 09:57:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-02-18 09:57:00,099 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-02-18 09:57:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:00,099 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-02-18 09:57:00,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:57:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-02-18 09:57:00,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-18 09:57:00,100 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:00,100 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-02-18 09:57:00,100 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:00,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:00,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-02-18 09:57:00,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:00,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:00,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:00,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:01,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:01,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:01,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:01,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:01,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:01,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:01,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:01,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:01,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:01,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:01,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:03,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:03,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:03,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-02-18 09:57:03,967 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:03,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:57:03,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:57:03,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:57:03,968 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-02-18 09:57:10,369 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-18 09:57:10,735 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-18 09:57:11,086 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-02-18 09:57:11,325 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:57:11,552 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:57:11,782 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:57:11,998 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:57:12,203 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:57:12,788 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-18 09:57:13,042 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-02-18 09:57:14,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:14,499 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-02-18 09:57:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-18 09:57:14,499 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-02-18 09:57:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:14,501 INFO L225 Difference]: With dead ends: 379 [2019-02-18 09:57:14,501 INFO L226 Difference]: Without dead ends: 281 [2019-02-18 09:57:14,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:57:14,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-18 09:57:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-02-18 09:57:14,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-02-18 09:57:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-02-18 09:57:14,540 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-02-18 09:57:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:14,540 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-02-18 09:57:14,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:57:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-02-18 09:57:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-02-18 09:57:14,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:14,542 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-18 09:57:14,542 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:14,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-02-18 09:57:14,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:14,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:14,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:14,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:14,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:16,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:16,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:16,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:16,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:16,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:16,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:16,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:16,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:16,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:16,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:17,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:17,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:18,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:18,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-02-18 09:57:18,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:18,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-18 09:57:18,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-18 09:57:18,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-02-18 09:57:18,338 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-02-18 09:57:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:20,255 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-02-18 09:57:20,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:57:20,256 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-02-18 09:57:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:20,257 INFO L225 Difference]: With dead ends: 390 [2019-02-18 09:57:20,258 INFO L226 Difference]: Without dead ends: 187 [2019-02-18 09:57:20,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:57:20,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-02-18 09:57:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-02-18 09:57:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-02-18 09:57:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-02-18 09:57:20,299 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-02-18 09:57:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:20,300 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-02-18 09:57:20,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-18 09:57:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-02-18 09:57:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-02-18 09:57:20,300 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:20,301 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-02-18 09:57:20,301 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:20,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:20,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-02-18 09:57:20,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:20,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:20,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:20,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:20,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:22,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:22,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:22,660 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:22,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:22,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:22,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:22,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:22,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:22,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-18 09:57:22,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:22,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:27,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:31,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:31,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-02-18 09:57:31,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:31,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-18 09:57:31,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-18 09:57:31,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-02-18 09:57:31,264 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-02-18 09:57:49,040 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-18 09:57:49,492 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-18 09:57:49,954 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-02-18 09:57:50,338 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:57:50,723 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:57:51,082 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:57:51,416 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:57:51,739 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:57:52,053 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:57:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:55,251 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-02-18 09:57:55,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-02-18 09:57:55,251 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-02-18 09:57:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:55,252 INFO L225 Difference]: With dead ends: 496 [2019-02-18 09:57:55,252 INFO L226 Difference]: Without dead ends: 289 [2019-02-18 09:57:55,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.1s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-02-18 09:57:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-02-18 09:57:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-02-18 09:57:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-02-18 09:57:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-02-18 09:57:55,293 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-02-18 09:57:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:55,293 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-02-18 09:57:55,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-18 09:57:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-02-18 09:57:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-02-18 09:57:55,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:55,294 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-02-18 09:57:55,294 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:55,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:55,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-02-18 09:57:55,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:55,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:55,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:55,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:55,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:57,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:57,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:57,169 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:57,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:57,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:57,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:57,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:57,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:57,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:57,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:57,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:58,913 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-02-18 09:58:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:01,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:01,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:01,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-02-18 09:58:01,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:01,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:58:01,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:58:01,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:58:01,507 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-02-18 09:58:10,107 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-18 09:58:10,510 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-18 09:58:10,900 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-02-18 09:58:11,320 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:58:11,579 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:58:11,841 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:58:12,083 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:58:12,317 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:58:12,549 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:58:12,765 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:58:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:15,213 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-02-18 09:58:15,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-18 09:58:15,213 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-02-18 09:58:15,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:15,215 INFO L225 Difference]: With dead ends: 409 [2019-02-18 09:58:15,215 INFO L226 Difference]: Without dead ends: 303 [2019-02-18 09:58:15,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-02-18 09:58:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-02-18 09:58:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-02-18 09:58:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-18 09:58:15,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-02-18 09:58:15,255 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-02-18 09:58:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:15,255 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-02-18 09:58:15,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:58:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-02-18 09:58:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-18 09:58:15,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:15,256 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-18 09:58:15,256 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:15,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-02-18 09:58:15,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:15,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:15,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:15,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:16,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:16,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:16,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:16,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:16,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:16,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:16,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:16,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:16,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:17,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:17,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:18,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:18,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-02-18 09:58:18,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:18,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-18 09:58:18,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-18 09:58:18,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-02-18 09:58:18,994 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-02-18 09:58:21,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:21,522 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-02-18 09:58:21,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 09:58:21,522 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-02-18 09:58:21,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:21,523 INFO L225 Difference]: With dead ends: 420 [2019-02-18 09:58:21,523 INFO L226 Difference]: Without dead ends: 201 [2019-02-18 09:58:21,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-02-18 09:58:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-02-18 09:58:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-02-18 09:58:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-18 09:58:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-02-18 09:58:21,562 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-02-18 09:58:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:21,563 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-02-18 09:58:21,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-18 09:58:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-02-18 09:58:21,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-18 09:58:21,563 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:21,563 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-02-18 09:58:21,564 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:21,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-02-18 09:58:21,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:21,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:21,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:21,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:23,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:23,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:23,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:23,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:23,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:23,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:23,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:23,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:23,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-18 09:58:23,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:23,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:25,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:25,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:25,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-02-18 09:58:25,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:25,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 09:58:25,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 09:58:25,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-02-18 09:58:25,933 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-02-18 09:58:34,462 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-18 09:58:34,978 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-18 09:58:35,409 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-02-18 09:58:35,697 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:58:35,972 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:58:36,245 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:58:36,513 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:58:36,761 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:58:37,002 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:58:37,238 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:58:37,461 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:58:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:39,867 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-02-18 09:58:39,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-02-18 09:58:39,867 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-02-18 09:58:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:39,869 INFO L225 Difference]: With dead ends: 424 [2019-02-18 09:58:39,869 INFO L226 Difference]: Without dead ends: 314 [2019-02-18 09:58:39,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-02-18 09:58:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-02-18 09:58:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-02-18 09:58:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-02-18 09:58:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-02-18 09:58:39,919 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-02-18 09:58:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:39,919 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-02-18 09:58:39,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 09:58:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-02-18 09:58:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-02-18 09:58:39,920 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:39,920 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-18 09:58:39,921 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-02-18 09:58:39,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:39,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:39,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:39,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:39,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:41,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:41,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:41,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:41,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:41,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:41,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:41,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:41,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:41,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:41,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:41,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:42,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:43,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:43,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-02-18 09:58:43,675 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:43,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 09:58:43,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 09:58:43,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-02-18 09:58:43,676 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-02-18 09:58:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:46,315 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-02-18 09:58:46,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 09:58:46,315 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-02-18 09:58:46,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:46,317 INFO L225 Difference]: With dead ends: 435 [2019-02-18 09:58:46,317 INFO L226 Difference]: Without dead ends: 208 [2019-02-18 09:58:46,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:58:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-02-18 09:58:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-02-18 09:58:46,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-02-18 09:58:46,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-02-18 09:58:46,366 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-02-18 09:58:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:46,366 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-02-18 09:58:46,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 09:58:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-02-18 09:58:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-02-18 09:58:46,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:46,367 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-02-18 09:58:46,367 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:46,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:46,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-02-18 09:58:46,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:46,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:46,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:46,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:46,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:48,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:48,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:48,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:48,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:48,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:48,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:48,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:48,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:48,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:50,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:50,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:51,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:51,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-02-18 09:58:51,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:51,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:58:51,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:58:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:58:51,006 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-02-18 09:59:00,063 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-18 09:59:00,564 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-18 09:59:01,051 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-02-18 09:59:01,382 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:59:01,680 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:59:01,964 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:59:02,245 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:59:02,516 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:59:02,778 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:59:03,027 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:59:03,263 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:59:03,484 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:59:03,923 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-18 09:59:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:06,113 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-02-18 09:59:06,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-02-18 09:59:06,113 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-02-18 09:59:06,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:06,115 INFO L225 Difference]: With dead ends: 439 [2019-02-18 09:59:06,115 INFO L226 Difference]: Without dead ends: 325 [2019-02-18 09:59:06,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 09:59:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-18 09:59:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-02-18 09:59:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-02-18 09:59:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-02-18 09:59:06,166 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-02-18 09:59:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:06,166 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-02-18 09:59:06,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:59:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-02-18 09:59:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-02-18 09:59:06,167 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:06,168 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-18 09:59:06,168 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-02-18 09:59:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:06,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:07,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:07,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:07,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:07,387 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:07,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:07,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:07,387 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:07,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:07,395 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:07,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-18 09:59:07,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:07,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:08,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:10,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:10,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-02-18 09:59:10,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:10,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-18 09:59:10,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-18 09:59:10,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-02-18 09:59:10,122 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-02-18 09:59:13,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:13,046 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-02-18 09:59:13,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 09:59:13,051 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-02-18 09:59:13,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:13,053 INFO L225 Difference]: With dead ends: 450 [2019-02-18 09:59:13,053 INFO L226 Difference]: Without dead ends: 215 [2019-02-18 09:59:13,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-02-18 09:59:13,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-18 09:59:13,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-02-18 09:59:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-02-18 09:59:13,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-02-18 09:59:13,101 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-02-18 09:59:13,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:13,101 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-02-18 09:59:13,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-18 09:59:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-02-18 09:59:13,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-02-18 09:59:13,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:13,103 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-02-18 09:59:13,103 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:13,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:13,103 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-02-18 09:59:13,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:13,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:13,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:13,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:13,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:15,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:15,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:15,300 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:15,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:15,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:15,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:59:15,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:59:15,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:59:15,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:15,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:18,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:18,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:18,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:18,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:18,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-02-18 09:59:18,294 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:18,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 09:59:18,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 09:59:18,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:59:18,295 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-02-18 09:59:28,640 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-18 09:59:29,104 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-18 09:59:29,564 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-02-18 09:59:29,886 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 09:59:30,190 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 09:59:30,493 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 09:59:30,789 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 09:59:31,123 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 09:59:31,439 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 09:59:31,705 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 09:59:31,957 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 09:59:32,206 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 09:59:32,437 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 09:59:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:34,947 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-02-18 09:59:34,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-02-18 09:59:34,948 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-02-18 09:59:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:34,949 INFO L225 Difference]: With dead ends: 454 [2019-02-18 09:59:34,950 INFO L226 Difference]: Without dead ends: 336 [2019-02-18 09:59:34,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-02-18 09:59:34,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-02-18 09:59:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-02-18 09:59:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-18 09:59:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-02-18 09:59:35,001 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-02-18 09:59:35,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:35,001 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-02-18 09:59:35,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 09:59:35,001 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-02-18 09:59:35,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-18 09:59:35,002 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:35,002 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-18 09:59:35,002 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:35,002 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-02-18 09:59:35,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:35,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:35,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:35,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:35,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:36,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:36,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:36,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:36,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:36,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:36,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:36,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:36,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:36,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:36,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:38,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:39,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:39,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-02-18 09:59:39,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:39,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 09:59:39,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 09:59:39,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-02-18 09:59:39,227 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-02-18 09:59:42,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:42,213 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-02-18 09:59:42,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 09:59:42,214 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-02-18 09:59:42,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:42,215 INFO L225 Difference]: With dead ends: 465 [2019-02-18 09:59:42,215 INFO L226 Difference]: Without dead ends: 222 [2019-02-18 09:59:42,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-02-18 09:59:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-02-18 09:59:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-02-18 09:59:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-18 09:59:42,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-02-18 09:59:42,262 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-02-18 09:59:42,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:42,262 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-02-18 09:59:42,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 09:59:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-02-18 09:59:42,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-18 09:59:42,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:42,263 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-02-18 09:59:42,264 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:42,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:42,264 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-02-18 09:59:42,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:42,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:42,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:42,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:44,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:44,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:44,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:44,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:44,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:44,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:44,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:44,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:44,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:44,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-18 09:59:44,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:44,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:50,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:55,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:55,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-02-18 09:59:55,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:55,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-18 09:59:55,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-18 09:59:55,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-02-18 09:59:55,956 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-02-18 10:00:20,370 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-18 10:00:20,938 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-18 10:00:21,575 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-02-18 10:00:22,088 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 10:00:22,670 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 10:00:23,147 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 10:00:23,609 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 10:00:24,056 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 10:00:24,491 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 10:00:24,905 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 10:00:25,312 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 10:00:25,691 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 10:00:26,083 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 10:00:26,439 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 10:00:27,435 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-02-18 10:00:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:30,103 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-02-18 10:00:30,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-02-18 10:00:30,104 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-02-18 10:00:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:30,105 INFO L225 Difference]: With dead ends: 591 [2019-02-18 10:00:30,105 INFO L226 Difference]: Without dead ends: 344 [2019-02-18 10:00:30,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-02-18 10:00:30,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-02-18 10:00:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-02-18 10:00:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-02-18 10:00:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-02-18 10:00:30,155 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-02-18 10:00:30,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:30,155 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-02-18 10:00:30,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-18 10:00:30,155 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-02-18 10:00:30,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-02-18 10:00:30,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:30,156 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-02-18 10:00:30,157 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:30,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:30,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-02-18 10:00:30,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:30,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:30,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:30,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:32,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:32,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:32,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:32,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:32,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:32,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:32,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:00:32,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:00:32,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:00:32,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:32,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:35,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:35,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:35,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:35,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-02-18 10:00:35,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:35,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 10:00:35,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 10:00:35,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-02-18 10:00:35,546 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-02-18 10:00:48,554 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-18 10:00:49,055 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-18 10:00:49,553 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-02-18 10:00:49,901 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 10:00:50,248 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 10:00:50,579 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 10:00:50,903 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 10:00:51,246 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 10:00:51,551 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 10:00:51,844 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 10:00:52,130 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 10:00:52,401 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 10:00:52,665 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 10:00:52,928 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 10:00:53,230 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 10:00:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:55,836 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-02-18 10:00:55,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-02-18 10:00:55,836 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-02-18 10:00:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:55,838 INFO L225 Difference]: With dead ends: 484 [2019-02-18 10:00:55,838 INFO L226 Difference]: Without dead ends: 358 [2019-02-18 10:00:55,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-02-18 10:00:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-02-18 10:00:55,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-02-18 10:00:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-02-18 10:00:55,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-02-18 10:00:55,890 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-02-18 10:00:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:55,891 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-02-18 10:00:55,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 10:00:55,891 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-02-18 10:00:55,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-02-18 10:00:55,892 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:55,892 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-18 10:00:55,893 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:55,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:55,893 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-02-18 10:00:55,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:55,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:55,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:57,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:57,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:57,415 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:57,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:57,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:57,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:57,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:57,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:00:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:57,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:59,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:01,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:01,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-02-18 10:01:01,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:01,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 10:01:01,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 10:01:01,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-02-18 10:01:01,028 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-02-18 10:01:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:03,565 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-02-18 10:01:03,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 10:01:03,566 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-02-18 10:01:03,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:03,567 INFO L225 Difference]: With dead ends: 495 [2019-02-18 10:01:03,567 INFO L226 Difference]: Without dead ends: 236 [2019-02-18 10:01:03,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-02-18 10:01:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-18 10:01:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-02-18 10:01:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-02-18 10:01:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-02-18 10:01:03,622 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-02-18 10:01:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:03,622 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-02-18 10:01:03,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 10:01:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-02-18 10:01:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-02-18 10:01:03,623 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:03,623 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-02-18 10:01:03,623 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:03,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-02-18 10:01:03,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:03,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:03,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:03,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:03,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:06,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:06,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:06,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:06,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:06,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:06,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:06,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:01:06,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:01:06,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-18 10:01:06,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:06,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:12,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:12,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:19,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:19,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-02-18 10:01:19,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:19,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-18 10:01:19,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-18 10:01:19,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-02-18 10:01:19,498 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-02-18 10:01:45,239 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-18 10:01:45,843 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-18 10:01:46,478 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-02-18 10:01:47,027 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 10:01:47,567 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 10:01:48,097 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 10:01:48,616 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 10:01:49,106 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 10:01:49,660 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 10:01:50,133 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 10:01:50,587 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 10:01:51,023 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 10:01:51,442 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 10:01:51,842 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 10:01:52,262 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 10:01:52,639 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 10:01:56,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:56,486 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-02-18 10:01:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-02-18 10:01:56,486 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-02-18 10:01:56,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:56,488 INFO L225 Difference]: With dead ends: 629 [2019-02-18 10:01:56,488 INFO L226 Difference]: Without dead ends: 366 [2019-02-18 10:01:56,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 44.0s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-02-18 10:01:56,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-02-18 10:01:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-02-18 10:01:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-18 10:01:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-02-18 10:01:56,546 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-02-18 10:01:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:56,546 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-02-18 10:01:56,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-18 10:01:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-02-18 10:01:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-18 10:01:56,547 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:56,547 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-02-18 10:01:56,547 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-02-18 10:01:56,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:56,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:56,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:56,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:56,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:56,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:59,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:59,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:59,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:59,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:59,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:59,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:59,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:01:59,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:01:59,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:01:59,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:59,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:02,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:02,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:02,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:02,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-02-18 10:02:02,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:02,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-18 10:02:02,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-18 10:02:02,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-02-18 10:02:02,446 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-02-18 10:02:14,545 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-18 10:02:15,159 WARN L181 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-18 10:02:15,710 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-02-18 10:02:16,103 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 10:02:16,463 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 10:02:16,825 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 10:02:17,180 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 10:02:17,524 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 10:02:17,862 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 10:02:18,191 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 10:02:18,516 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 10:02:18,824 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 10:02:19,117 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 10:02:19,402 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 10:02:19,681 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 10:02:19,958 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 10:02:20,294 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 10:02:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:23,142 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-02-18 10:02:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-02-18 10:02:23,143 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-02-18 10:02:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:23,144 INFO L225 Difference]: With dead ends: 514 [2019-02-18 10:02:23,144 INFO L226 Difference]: Without dead ends: 380 [2019-02-18 10:02:23,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 10:02:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-02-18 10:02:23,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-02-18 10:02:23,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-02-18 10:02:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-02-18 10:02:23,199 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-02-18 10:02:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:23,199 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-02-18 10:02:23,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-18 10:02:23,199 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-02-18 10:02:23,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-02-18 10:02:23,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:23,200 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-18 10:02:23,200 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:23,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:23,201 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-02-18 10:02:23,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:23,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:23,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:24,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:24,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:24,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:24,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:24,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:24,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:24,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:24,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:02:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:24,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:27,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:27,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:28,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:28,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-02-18 10:02:28,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:28,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-18 10:02:28,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-18 10:02:28,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-02-18 10:02:28,481 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-02-18 10:02:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:31,250 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-02-18 10:02:31,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-18 10:02:31,250 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-02-18 10:02:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:31,252 INFO L225 Difference]: With dead ends: 525 [2019-02-18 10:02:31,252 INFO L226 Difference]: Without dead ends: 250 [2019-02-18 10:02:31,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 10:02:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-02-18 10:02:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-02-18 10:02:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-02-18 10:02:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-02-18 10:02:31,313 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-02-18 10:02:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:31,313 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-02-18 10:02:31,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-18 10:02:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-02-18 10:02:31,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-02-18 10:02:31,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:31,315 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-02-18 10:02:31,315 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:31,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-02-18 10:02:31,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:31,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:31,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:31,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:31,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:34,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:34,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:34,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:34,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:34,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:34,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:34,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:02:34,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:02:34,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-18 10:02:34,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:34,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:42,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:48,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:48,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:48,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-02-18 10:02:48,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:48,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-02-18 10:02:48,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-02-18 10:02:48,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 10:02:48,892 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-02-18 10:03:16,778 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-18 10:03:17,430 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-18 10:03:18,131 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-02-18 10:03:18,744 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-18 10:03:19,355 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 10:03:19,945 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 10:03:20,511 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 10:03:21,056 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 10:03:21,648 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 10:03:22,194 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 10:03:22,713 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 10:03:23,206 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 10:03:23,683 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 10:03:24,147 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 10:03:24,584 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 10:03:25,012 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 10:03:25,428 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 10:03:25,816 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 10:03:26,538 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-02-18 10:03:29,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:29,861 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-02-18 10:03:29,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-02-18 10:03:29,862 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-02-18 10:03:29,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:29,864 INFO L225 Difference]: With dead ends: 667 [2019-02-18 10:03:29,864 INFO L226 Difference]: Without dead ends: 388 [2019-02-18 10:03:29,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-02-18 10:03:29,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-02-18 10:03:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-02-18 10:03:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-02-18 10:03:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-02-18 10:03:29,929 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-02-18 10:03:29,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:29,929 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-02-18 10:03:29,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-02-18 10:03:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-02-18 10:03:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-02-18 10:03:29,930 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:29,930 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-02-18 10:03:29,931 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:29,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:29,931 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-02-18 10:03:29,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:29,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:29,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:29,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:29,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:33,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:33,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:33,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:33,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:33,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:33,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:03:33,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:03:33,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:03:33,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:03:33,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:33,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:36,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:36,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:36,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-02-18 10:03:36,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:36,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-18 10:03:36,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-18 10:03:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-02-18 10:03:36,698 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-02-18 10:03:51,051 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-18 10:03:51,639 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-18 10:03:52,255 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-02-18 10:03:52,699 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-18 10:03:53,109 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-18 10:03:53,515 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 10:03:53,900 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 10:03:54,281 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 10:03:54,637 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 10:03:54,993 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 10:03:55,356 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 10:03:55,701 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 10:03:56,040 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 10:03:56,363 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 10:03:56,672 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 10:03:56,973 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 10:03:57,278 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 10:03:57,635 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 10:04:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:00,835 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-02-18 10:04:00,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-02-18 10:04:00,835 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-02-18 10:04:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:00,837 INFO L225 Difference]: With dead ends: 544 [2019-02-18 10:04:00,837 INFO L226 Difference]: Without dead ends: 402 [2019-02-18 10:04:00,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-02-18 10:04:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-02-18 10:04:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-02-18 10:04:00,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-18 10:04:00,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-02-18 10:04:00,900 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-02-18 10:04:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:00,900 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-02-18 10:04:00,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-18 10:04:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-02-18 10:04:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-18 10:04:00,901 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:00,902 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-18 10:04:00,902 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:00,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:00,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-02-18 10:04:00,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:00,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:00,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:00,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:02,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:02,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:02,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:02,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:02,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:02,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:02,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:03,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:03,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:04:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:03,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:05,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:06,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:06,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:06,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-02-18 10:04:06,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:06,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-18 10:04:06,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-18 10:04:06,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-02-18 10:04:06,736 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-02-18 10:04:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:09,826 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-02-18 10:04:09,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-18 10:04:09,826 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-02-18 10:04:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:09,828 INFO L225 Difference]: With dead ends: 555 [2019-02-18 10:04:09,828 INFO L226 Difference]: Without dead ends: 264 [2019-02-18 10:04:09,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-02-18 10:04:09,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-02-18 10:04:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-02-18 10:04:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-18 10:04:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-02-18 10:04:09,890 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-02-18 10:04:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:09,890 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-02-18 10:04:09,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-18 10:04:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-02-18 10:04:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-18 10:04:09,891 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:09,891 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-02-18 10:04:09,891 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-02-18 10:04:09,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:09,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:09,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:09,893 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:13,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:13,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:13,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:13,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:13,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:13,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:13,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:04:13,393 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:04:13,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-18 10:04:13,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:13,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:21,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:29,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:29,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-02-18 10:04:29,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:29,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-02-18 10:04:29,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-02-18 10:04:29,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-02-18 10:04:29,753 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-02-18 10:05:01,092 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-18 10:05:01,880 WARN L181 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-18 10:05:02,637 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-02-18 10:05:03,309 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-18 10:05:04,037 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-18 10:05:04,712 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-18 10:05:05,335 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 10:05:05,930 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 10:05:06,528 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 10:05:07,110 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 10:05:07,684 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 10:05:08,221 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 10:05:08,747 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 10:05:09,303 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 10:05:09,801 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 10:05:10,282 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 10:05:10,736 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 10:05:11,173 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 10:05:11,604 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 10:05:12,021 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 10:05:12,404 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-02-18 10:05:14,880 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-02-18 10:05:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:16,403 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-02-18 10:05:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-02-18 10:05:16,403 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-02-18 10:05:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:16,405 INFO L225 Difference]: With dead ends: 705 [2019-02-18 10:05:16,405 INFO L226 Difference]: Without dead ends: 410 [2019-02-18 10:05:16,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-02-18 10:05:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-02-18 10:05:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-02-18 10:05:16,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-02-18 10:05:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-02-18 10:05:16,482 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-02-18 10:05:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:16,482 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-02-18 10:05:16,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-02-18 10:05:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-02-18 10:05:16,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-02-18 10:05:16,483 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:16,484 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-02-18 10:05:16,484 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:16,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:16,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-02-18 10:05:16,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:16,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:16,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:16,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:16,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:19,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:19,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:19,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:19,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:19,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:19,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:05:19,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:05:19,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:05:19,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:05:19,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:05:19,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:23,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:23,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:23,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-02-18 10:05:23,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:23,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-18 10:05:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-18 10:05:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 10:05:23,712 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-02-18 10:05:40,100 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-18 10:05:40,737 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-02-18 10:05:41,357 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-02-18 10:05:41,815 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-02-18 10:05:42,258 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-02-18 10:05:42,677 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-02-18 10:05:43,089 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-02-18 10:05:43,516 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-02-18 10:05:43,908 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-02-18 10:05:44,286 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-02-18 10:05:44,668 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-02-18 10:05:45,163 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-02-18 10:05:45,536 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-02-18 10:05:45,897 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-02-18 10:05:46,234 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-02-18 10:05:46,564 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-02-18 10:05:46,890 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-02-18 10:05:47,196 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-02-18 10:05:47,491 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-02-18 10:05:47,778 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-02-18 10:05:48,049 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-02-18 10:05:51,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:51,221 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-02-18 10:05:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-02-18 10:05:51,222 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-02-18 10:05:51,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:51,224 INFO L225 Difference]: With dead ends: 574 [2019-02-18 10:05:51,224 INFO L226 Difference]: Without dead ends: 424 [2019-02-18 10:05:51,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-02-18 10:05:51,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-02-18 10:05:51,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-02-18 10:05:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-02-18 10:05:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-02-18 10:05:51,310 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-02-18 10:05:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:51,310 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-02-18 10:05:51,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-18 10:05:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-02-18 10:05:51,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-02-18 10:05:51,311 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:51,311 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-18 10:05:51,311 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:51,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:51,311 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-02-18 10:05:51,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:51,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:51,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:51,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:53,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:53,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:53,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:53,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:53,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:53,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:05:53,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:05:53,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:05:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:53,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:55,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:57,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:57,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-02-18 10:05:57,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:57,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-18 10:05:57,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-18 10:05:57,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-02-18 10:05:57,628 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-02-18 10:06:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:06:01,096 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-02-18 10:06:01,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-18 10:06:01,096 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-02-18 10:06:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:06:01,098 INFO L225 Difference]: With dead ends: 585 [2019-02-18 10:06:01,098 INFO L226 Difference]: Without dead ends: 278 [2019-02-18 10:06:01,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-02-18 10:06:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-18 10:06:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-02-18 10:06:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-02-18 10:06:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-02-18 10:06:01,177 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-02-18 10:06:01,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:06:01,178 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-02-18 10:06:01,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-18 10:06:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-02-18 10:06:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-02-18 10:06:01,178 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:06:01,179 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-02-18 10:06:01,179 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:06:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:06:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-02-18 10:06:01,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:06:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:01,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:06:01,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:06:01,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:06:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:06:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:04,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:04,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:06:04,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:06:04,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:06:04,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:06:04,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:06:04,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:06:04,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:06:04,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-18 10:06:04,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:06:04,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:06:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:06:13,740 INFO L316 TraceCheckSpWp]: Computing backward predicates...