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-fa1c628-m [2019-01-31 17:21:42,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:21:42,464 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:21:42,478 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:21:42,478 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:21:42,479 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:21:42,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:21:42,482 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:21:42,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:21:42,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:21:42,486 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:21:42,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:21:42,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:21:42,488 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:21:42,489 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:21:42,490 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:21:42,491 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:21:42,493 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:21:42,495 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:21:42,497 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:21:42,498 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:21:42,499 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:21:42,501 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:21:42,502 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:21:42,502 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:21:42,503 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:21:42,504 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:21:42,505 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:21:42,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:21:42,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:21:42,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:21:42,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:21:42,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:21:42,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:21:42,509 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:21:42,510 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:21:42,510 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-01-31 17:21:42,528 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:21:42,528 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:21:42,529 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:21:42,529 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:21:42,529 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:21:42,530 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:21:42,530 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:21:42,530 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:21:42,530 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:21:42,530 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:21:42,531 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:21:42,533 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:21:42,533 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:21:42,534 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:21:42,534 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:21:42,534 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:21:42,534 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:21:42,535 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:21:42,535 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:21:42,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:21:42,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:21:42,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:21:42,536 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:21:42,536 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:21:42,536 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:21:42,536 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:21:42,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:21:42,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:21:42,539 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:21:42,539 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:21:42,539 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:21:42,539 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:21:42,540 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:21:42,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:21:42,540 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:21:42,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:21:42,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:21:42,541 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:21:42,541 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:21:42,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:21:42,597 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:21:42,605 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:21:42,607 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:21:42,608 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:21:42,609 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-01-31 17:21:42,609 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-01-31 17:21:42,643 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:21:42,645 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:21:42,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:42,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:21:42,646 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:21:42,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/1) ... [2019-01-31 17:21:42,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/1) ... [2019-01-31 17:21:42,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:21:42,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:21:42,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:21:42,684 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:21:42,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/1) ... [2019-01-31 17:21:42,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/1) ... [2019-01-31 17:21:42,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/1) ... [2019-01-31 17:21:42,697 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/1) ... [2019-01-31 17:21:42,700 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/1) ... [2019-01-31 17:21:42,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/1) ... [2019-01-31 17:21:42,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/1) ... [2019-01-31 17:21:42,708 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:21:42,709 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:21:42,709 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:21:42,709 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:21:42,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (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-01-31 17:21:42,782 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-01-31 17:21:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:21:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:21:43,170 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:21:43,171 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-31 17:21:43,172 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:43 BoogieIcfgContainer [2019-01-31 17:21:43,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:21:43,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:21:43,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:21:43,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:21:43,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:21:42" (1/2) ... [2019-01-31 17:21:43,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff7745f and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:21:43, skipping insertion in model container [2019-01-31 17:21:43,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:21:43" (2/2) ... [2019-01-31 17:21:43,180 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-01-31 17:21:43,188 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:21:43,195 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-31 17:21:43,209 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-31 17:21:43,244 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:21:43,244 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:21:43,244 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:21:43,245 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:21:43,245 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:21:43,245 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:21:43,245 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:21:43,245 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:21:43,261 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-31 17:21:43,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-31 17:21:43,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:43,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-31 17:21:43,272 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:43,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:43,279 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-01-31 17:21:43,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:43,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:43,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:43,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:43,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:43,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:21:43,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 17:21:43,542 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:21:43,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:21:43,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:21:43,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:21:43,566 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-01-31 17:21:43,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:43,733 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-31 17:21:43,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:21:43,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-31 17:21:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:43,746 INFO L225 Difference]: With dead ends: 26 [2019-01-31 17:21:43,747 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 17:21:43,750 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-01-31 17:21:43,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 17:21:43,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-31 17:21:43,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-31 17:21:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-31 17:21:43,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-01-31 17:21:43,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:43,790 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-31 17:21:43,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:21:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-01-31 17:21:43,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:21:43,791 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:43,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:21:43,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:43,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:43,792 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-01-31 17:21:43,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:43,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:43,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:43,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:43,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:43,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:43,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:21:43,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-31 17:21:43,895 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:21:43,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:21:43,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:21:43,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:21:43,898 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-01-31 17:21:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:44,013 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-31 17:21:44,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:21:44,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-31 17:21:44,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:44,015 INFO L225 Difference]: With dead ends: 25 [2019-01-31 17:21:44,016 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 17:21:44,017 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-01-31 17:21:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 17:21:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-31 17:21:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-31 17:21:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-31 17:21:44,026 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-01-31 17:21:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:44,028 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-31 17:21:44,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:21:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-01-31 17:21:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:21:44,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:44,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:21:44,029 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:44,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:44,030 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-01-31 17:21:44,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:44,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:44,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:44,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:21:44,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:21:44,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-31 17:21:44,121 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:21:44,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:21:44,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:21:44,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:21:44,122 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-01-31 17:21:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:44,151 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-31 17:21:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:21:44,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-31 17:21:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:44,153 INFO L225 Difference]: With dead ends: 24 [2019-01-31 17:21:44,153 INFO L226 Difference]: Without dead ends: 13 [2019-01-31 17:21:44,153 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-01-31 17:21:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-31 17:21:44,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-31 17:21:44,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-31 17:21:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-31 17:21:44,157 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-01-31 17:21:44,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:44,157 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-31 17:21:44,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:21:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-31 17:21:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-31 17:21:44,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:44,158 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:21:44,158 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:44,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:44,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-01-31 17:21:44,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:44,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:44,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:44,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:44,162 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:44,484 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-31 17:21:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:44,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:44,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:44,535 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-31 17:21:44,538 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-01-31 17:21:44,595 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:21:44,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:21:44,868 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:21:44,871 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-01-31 17:21:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:44,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:21:44,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:44,884 INFO 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-01-31 17:21:44,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:44,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:44,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:45,283 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-31 17:21:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:45,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:45,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:45,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-01-31 17:21:45,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:45,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:21:45,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:21:45,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-31 17:21:45,355 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-31 17:21:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:45,599 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-31 17:21:45,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-31 17:21:45,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-31 17:21:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:45,601 INFO L225 Difference]: With dead ends: 26 [2019-01-31 17:21:45,601 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 17:21:45,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-31 17:21:45,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 17:21:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-31 17:21:45,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 17:21:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-31 17:21:45,607 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-01-31 17:21:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:45,607 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-31 17:21:45,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:21:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-31 17:21:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-31 17:21:45,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:45,608 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:21:45,608 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:45,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:45,609 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-01-31 17:21:45,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:45,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:45,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:45,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:45,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:45,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:45,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:45,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-01-31 17:21:45,780 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-01-31 17:21:45,783 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:21:45,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:21:45,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-31 17:21:45,940 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-01-31 17:21:45,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:45,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-31 17:21:45,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:45,941 INFO 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-01-31 17:21:45,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:45,955 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:45,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:46,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:46,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:46,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-01-31 17:21:46,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:46,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-31 17:21:46,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-31 17:21:46,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-31 17:21:46,644 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-31 17:21:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:46,948 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-31 17:21:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:21:46,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-31 17:21:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:46,950 INFO L225 Difference]: With dead ends: 31 [2019-01-31 17:21:46,950 INFO L226 Difference]: Without dead ends: 19 [2019-01-31 17:21:46,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:21:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-31 17:21:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-31 17:21:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:21:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-31 17:21:47,023 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-31 17:21:47,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:47,024 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-31 17:21:47,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-31 17:21:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-31 17:21:47,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-31 17:21:47,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:47,025 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-31 17:21:47,025 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:47,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-01-31 17:21:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:47,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:47,032 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:47,473 WARN L181 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2019-01-31 17:21:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:47,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:47,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:47,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:47,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:47,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:47,627 INFO 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-01-31 17:21:47,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:47,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:47,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-31 17:21:47,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:47,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:47,748 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:47,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:47,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:47,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-01-31 17:21:47,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:47,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:21:47,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:21:47,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:21:47,820 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-31 17:21:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:48,101 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-31 17:21:48,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-31 17:21:48,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-31 17:21:48,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:48,103 INFO L225 Difference]: With dead ends: 35 [2019-01-31 17:21:48,103 INFO L226 Difference]: Without dead ends: 28 [2019-01-31 17:21:48,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-31 17:21:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-31 17:21:48,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-01-31 17:21:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 17:21:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-31 17:21:48,110 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-01-31 17:21:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:48,110 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-31 17:21:48,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:21:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-31 17:21:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-31 17:21:48,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:48,111 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-31 17:21:48,111 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:48,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-01-31 17:21:48,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:48,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:48,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:48,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:48,214 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:48,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,215 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:48,215 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:48,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:48,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,216 INFO 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-01-31 17:21:48,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:48,225 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:48,232 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:48,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:48,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:48,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:48,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:48,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:48,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-01-31 17:21:48,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:48,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-31 17:21:48,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-31 17:21:48,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:21:48,345 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-01-31 17:21:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:48,468 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-31 17:21:48,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-31 17:21:48,469 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-31 17:21:48,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:48,469 INFO L225 Difference]: With dead ends: 45 [2019-01-31 17:21:48,470 INFO L226 Difference]: Without dead ends: 26 [2019-01-31 17:21:48,471 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-01-31 17:21:48,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-31 17:21:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-31 17:21:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-31 17:21:48,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-31 17:21:48,476 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-01-31 17:21:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:48,476 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-31 17:21:48,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-31 17:21:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-31 17:21:48,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-31 17:21:48,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:48,477 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-31 17:21:48,478 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:48,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:48,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-01-31 17:21:48,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:48,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:48,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:48,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:48,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:48,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:48,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:48,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:48,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:48,758 INFO 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-01-31 17:21:48,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:48,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:48,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:48,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:48,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:48,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-01-31 17:21:48,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:48,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:21:48,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:21:48,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:21:48,954 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-01-31 17:21:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:49,317 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-31 17:21:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-31 17:21:49,321 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-31 17:21:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:49,322 INFO L225 Difference]: With dead ends: 49 [2019-01-31 17:21:49,322 INFO L226 Difference]: Without dead ends: 39 [2019-01-31 17:21:49,323 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-01-31 17:21:49,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-31 17:21:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-31 17:21:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-31 17:21:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-31 17:21:49,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-31 17:21:49,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:49,329 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-31 17:21:49,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:21:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-31 17:21:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-31 17:21:49,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:49,331 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-31 17:21:49,331 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-01-31 17:21:49,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:49,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:49,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:49,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:49,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:49,424 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:49,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:49,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:49,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:49,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:49,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:49,426 INFO 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-01-31 17:21:49,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:49,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:49,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-31 17:21:49,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:49,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:49,532 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:49,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:49,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:49,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-01-31 17:21:49,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:49,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-31 17:21:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-31 17:21:49,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-31 17:21:49,628 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-01-31 17:21:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:50,215 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-01-31 17:21:50,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-31 17:21:50,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-31 17:21:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:50,217 INFO L225 Difference]: With dead ends: 60 [2019-01-31 17:21:50,217 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 17:21:50,218 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-01-31 17:21:50,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 17:21:50,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-31 17:21:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-31 17:21:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-31 17:21:50,224 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-31 17:21:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:50,224 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-31 17:21:50,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-31 17:21:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-31 17:21:50,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-31 17:21:50,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:50,225 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-31 17:21:50,225 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:50,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:50,226 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-01-31 17:21:50,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:50,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:50,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:50,453 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:50,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:50,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:50,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:50,454 INFO 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-01-31 17:21:50,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:50,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:50,472 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:50,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:50,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:50,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:50,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-01-31 17:21:50,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:50,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 17:21:50,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 17:21:50,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:21:50,687 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-01-31 17:21:51,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:51,236 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-01-31 17:21:51,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-31 17:21:51,239 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-31 17:21:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:51,240 INFO L225 Difference]: With dead ends: 64 [2019-01-31 17:21:51,241 INFO L226 Difference]: Without dead ends: 50 [2019-01-31 17:21:51,242 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-01-31 17:21:51,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-31 17:21:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-31 17:21:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:21:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-31 17:21:51,248 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-01-31 17:21:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:51,249 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-31 17:21:51,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 17:21:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-31 17:21:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-31 17:21:51,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:51,250 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-31 17:21:51,250 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-01-31 17:21:51,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:51,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:51,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:51,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:51,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:51,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:51,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:51,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:51,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:51,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:51,490 INFO 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-01-31 17:21:51,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:51,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:51,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:51,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:51,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:51,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-01-31 17:21:51,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:51,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-31 17:21:51,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-31 17:21:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-01-31 17:21:51,823 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-01-31 17:21:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:52,130 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-31 17:21:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-31 17:21:52,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-31 17:21:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:52,132 INFO L225 Difference]: With dead ends: 75 [2019-01-31 17:21:52,132 INFO L226 Difference]: Without dead ends: 40 [2019-01-31 17:21:52,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-31 17:21:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-31 17:21:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-31 17:21:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-31 17:21:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-31 17:21:52,138 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-01-31 17:21:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:52,139 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-31 17:21:52,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-31 17:21:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-31 17:21:52,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-31 17:21:52,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:52,140 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-31 17:21:52,140 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:52,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:52,141 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-01-31 17:21:52,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:52,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:52,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:52,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:52,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:52,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:52,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:52,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:52,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:52,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:52,400 INFO 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-01-31 17:21:52,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:52,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:52,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-31 17:21:52,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:52,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:53,297 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:53,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:53,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:53,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-01-31 17:21:53,703 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:53,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-31 17:21:53,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-31 17:21:53,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 17:21:53,705 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-01-31 17:21:55,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:55,757 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-31 17:21:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-31 17:21:55,757 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-01-31 17:21:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:55,759 INFO L225 Difference]: With dead ends: 97 [2019-01-31 17:21:55,759 INFO L226 Difference]: Without dead ends: 58 [2019-01-31 17:21:55,763 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-01-31 17:21:55,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-31 17:21:55,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-01-31 17:21:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-31 17:21:55,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-31 17:21:55,770 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-01-31 17:21:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:55,771 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-31 17:21:55,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-31 17:21:55,771 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-31 17:21:55,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-31 17:21:55,772 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:55,772 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-31 17:21:55,772 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:55,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:55,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-01-31 17:21:55,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:55,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:55,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:55,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:55,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:56,336 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:56,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:56,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:56,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:56,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:56,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:56,337 INFO 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-01-31 17:21:56,347 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:21:56,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:21:56,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:21:56,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:56,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:56,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:56,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:56,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-01-31 17:21:56,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:56,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 17:21:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 17:21:56,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:21:56,743 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-01-31 17:21:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:58,131 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-01-31 17:21:58,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-31 17:21:58,131 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-31 17:21:58,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:58,133 INFO L225 Difference]: With dead ends: 94 [2019-01-31 17:21:58,133 INFO L226 Difference]: Without dead ends: 72 [2019-01-31 17:21:58,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-01-31 17:21:58,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-31 17:21:58,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-01-31 17:21:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-31 17:21:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-31 17:21:58,144 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-01-31 17:21:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:58,144 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-31 17:21:58,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 17:21:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-31 17:21:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-31 17:21:58,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:58,145 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-31 17:21:58,146 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:58,146 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-01-31 17:21:58,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:58,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:58,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:21:58,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:58,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:58,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:58,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:58,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:58,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:58,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:58,322 INFO 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-01-31 17:21:58,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:58,331 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:21:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:58,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:58,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:58,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:58,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-01-31 17:21:58,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:58,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-31 17:21:58,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-31 17:21:58,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-31 17:21:58,699 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-01-31 17:21:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:21:58,949 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-31 17:21:58,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-31 17:21:58,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-31 17:21:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:21:58,951 INFO L225 Difference]: With dead ends: 105 [2019-01-31 17:21:58,951 INFO L226 Difference]: Without dead ends: 54 [2019-01-31 17:21:58,952 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-01-31 17:21:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-31 17:21:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-31 17:21:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-31 17:21:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-31 17:21:58,961 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-01-31 17:21:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:21:58,961 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-31 17:21:58,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-31 17:21:58,962 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-31 17:21:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-31 17:21:58,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:21:58,964 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-31 17:21:58,964 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:21:58,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:21:58,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-01-31 17:21:58,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:21:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:58,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:21:58,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:21:58,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:21:58,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:21:59,332 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:59,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:59,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:21:59,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:21:59,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:21:59,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:21:59,333 INFO 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-01-31 17:21:59,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:21:59,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:21:59,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-31 17:21:59,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:21:59,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:21:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:59,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:21:59,737 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:21:59,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:21:59,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-01-31 17:21:59,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:21:59,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 17:21:59,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 17:21:59,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-01-31 17:21:59,758 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-01-31 17:22:01,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:01,246 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-31 17:22:01,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-31 17:22:01,246 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-01-31 17:22:01,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:01,248 INFO L225 Difference]: With dead ends: 109 [2019-01-31 17:22:01,248 INFO L226 Difference]: Without dead ends: 83 [2019-01-31 17:22:01,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-01-31 17:22:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-31 17:22:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-31 17:22:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-31 17:22:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-31 17:22:01,259 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-01-31 17:22:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:01,260 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-31 17:22:01,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 17:22:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-31 17:22:01,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-31 17:22:01,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:01,261 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-31 17:22:01,261 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-01-31 17:22:01,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:01,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:01,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:01,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:01,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:01,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:01,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:01,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:01,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:01,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:01,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:22:01,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:01,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:01,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:01,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:01,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:01,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:01,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:01,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-01-31 17:22:01,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:01,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-31 17:22:01,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-31 17:22:01,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-01-31 17:22:01,922 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-01-31 17:22:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:02,313 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-31 17:22:02,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-31 17:22:02,314 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-31 17:22:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:02,316 INFO L225 Difference]: With dead ends: 120 [2019-01-31 17:22:02,316 INFO L226 Difference]: Without dead ends: 61 [2019-01-31 17:22:02,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-01-31 17:22:02,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-31 17:22:02,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-31 17:22:02,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-31 17:22:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-01-31 17:22:02,328 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-01-31 17:22:02,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:02,328 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-01-31 17:22:02,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-31 17:22:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-01-31 17:22:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-31 17:22:02,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:02,331 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-31 17:22:02,332 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:02,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:02,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-01-31 17:22:02,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:02,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:02,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:02,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:03,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:03,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:03,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:03,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:03,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:03,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:22:03,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:03,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:03,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:03,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:03,413 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:03,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:03,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-01-31 17:22:03,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:03,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 17:22:03,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 17:22:03,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-01-31 17:22:03,434 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-01-31 17:22:04,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:04,969 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-01-31 17:22:04,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-31 17:22:04,973 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-01-31 17:22:04,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:04,974 INFO L225 Difference]: With dead ends: 124 [2019-01-31 17:22:04,974 INFO L226 Difference]: Without dead ends: 94 [2019-01-31 17:22:04,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-01-31 17:22:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-31 17:22:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-01-31 17:22:04,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-31 17:22:04,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-31 17:22:04,993 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-01-31 17:22:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:04,993 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-31 17:22:04,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 17:22:04,994 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-31 17:22:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-31 17:22:04,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:04,999 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-31 17:22:05,000 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-01-31 17:22:05,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:05,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:05,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:05,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:05,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:05,241 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:05,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:05,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:05,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:05,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:05,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:05,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:22:05,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:05,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:05,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-31 17:22:05,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:05,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:05,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:05,752 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:05,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:05,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-01-31 17:22:05,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:05,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-31 17:22:05,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-31 17:22:05,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-01-31 17:22:05,773 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-01-31 17:22:06,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:06,356 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-31 17:22:06,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-31 17:22:06,356 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-01-31 17:22:06,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:06,357 INFO L225 Difference]: With dead ends: 135 [2019-01-31 17:22:06,358 INFO L226 Difference]: Without dead ends: 68 [2019-01-31 17:22:06,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 17:22:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-31 17:22:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-31 17:22:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-31 17:22:06,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-31 17:22:06,387 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-01-31 17:22:06,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:06,388 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-31 17:22:06,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-31 17:22:06,388 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-31 17:22:06,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-31 17:22:06,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:06,392 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-31 17:22:06,392 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:06,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:06,393 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-01-31 17:22:06,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:06,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:06,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:06,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:06,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:07,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:07,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:07,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:07,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:07,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:07,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 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-01-31 17:22:07,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:07,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:07,125 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:07,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:07,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:07,468 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:07,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:07,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:07,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-01-31 17:22:07,546 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:07,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 17:22:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 17:22:07,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-01-31 17:22:07,548 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-01-31 17:22:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:09,481 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-01-31 17:22:09,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-31 17:22:09,482 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-01-31 17:22:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:09,483 INFO L225 Difference]: With dead ends: 139 [2019-01-31 17:22:09,483 INFO L226 Difference]: Without dead ends: 105 [2019-01-31 17:22:09,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 17:22:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-31 17:22:09,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-01-31 17:22:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-31 17:22:09,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-31 17:22:09,495 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-01-31 17:22:09,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:09,495 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-31 17:22:09,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 17:22:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-31 17:22:09,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-31 17:22:09,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:09,496 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-31 17:22:09,497 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:09,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:09,497 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-01-31 17:22:09,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:09,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:09,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:09,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:09,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:09,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:09,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:09,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:09,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:09,804 INFO 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-01-31 17:22:09,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:09,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:09,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:10,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:10,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:10,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-01-31 17:22:10,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:10,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-31 17:22:10,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-31 17:22:10,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-01-31 17:22:10,709 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-01-31 17:22:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:11,118 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-01-31 17:22:11,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-31 17:22:11,118 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-01-31 17:22:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:11,120 INFO L225 Difference]: With dead ends: 150 [2019-01-31 17:22:11,120 INFO L226 Difference]: Without dead ends: 75 [2019-01-31 17:22:11,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-01-31 17:22:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-31 17:22:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-31 17:22:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-31 17:22:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-01-31 17:22:11,132 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-01-31 17:22:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:11,132 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-01-31 17:22:11,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-31 17:22:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-01-31 17:22:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-31 17:22:11,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:11,134 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-31 17:22:11,134 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-01-31 17:22:11,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:11,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:11,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:11,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:11,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:11,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:11,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:11,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:11,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:11,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:11,789 INFO 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-01-31 17:22:11,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:11,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:11,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-31 17:22:11,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:11,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:12,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:13,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:13,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-01-31 17:22:13,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:13,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 17:22:13,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 17:22:13,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-01-31 17:22:13,603 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-01-31 17:22:16,187 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-31 17:22:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:18,405 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-01-31 17:22:18,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-31 17:22:18,405 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-01-31 17:22:18,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:18,407 INFO L225 Difference]: With dead ends: 192 [2019-01-31 17:22:18,407 INFO L226 Difference]: Without dead ends: 113 [2019-01-31 17:22:18,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-01-31 17:22:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-31 17:22:18,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-01-31 17:22:18,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-31 17:22:18,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-01-31 17:22:18,423 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-01-31 17:22:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:18,424 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-01-31 17:22:18,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 17:22:18,424 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-01-31 17:22:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-31 17:22:18,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:18,424 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-31 17:22:18,425 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:18,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:18,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-01-31 17:22:18,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:18,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:18,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:18,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:18,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:19,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:19,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:19,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:19,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:19,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:19,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:22:19,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:19,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:19,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:19,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:19,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:20,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:20,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:20,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-01-31 17:22:20,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:20,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 17:22:20,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 17:22:20,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 17:22:20,286 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-01-31 17:22:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:22,672 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-01-31 17:22:22,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-31 17:22:22,676 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-01-31 17:22:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:22,677 INFO L225 Difference]: With dead ends: 169 [2019-01-31 17:22:22,677 INFO L226 Difference]: Without dead ends: 127 [2019-01-31 17:22:22,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-01-31 17:22:22,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-31 17:22:22,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-01-31 17:22:22,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-31 17:22:22,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-01-31 17:22:22,689 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-01-31 17:22:22,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:22,690 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-01-31 17:22:22,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 17:22:22,690 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-01-31 17:22:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-31 17:22:22,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:22,691 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-31 17:22:22,691 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:22,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:22,691 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-01-31 17:22:22,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:22,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:22,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:22,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:22,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:23,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:23,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:23,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:23,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:23,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:23,183 INFO 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-01-31 17:22:23,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:23,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:23,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:23,539 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:23,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:23,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:23,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-01-31 17:22:23,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:23,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-31 17:22:23,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-31 17:22:23,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-01-31 17:22:23,774 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-01-31 17:22:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:24,331 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-01-31 17:22:24,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-31 17:22:24,331 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-01-31 17:22:24,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:24,333 INFO L225 Difference]: With dead ends: 180 [2019-01-31 17:22:24,333 INFO L226 Difference]: Without dead ends: 89 [2019-01-31 17:22:24,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 17:22:24,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-31 17:22:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-31 17:22:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-31 17:22:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-01-31 17:22:24,345 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-01-31 17:22:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:24,345 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-01-31 17:22:24,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-31 17:22:24,346 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-01-31 17:22:24,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-31 17:22:24,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:24,347 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-31 17:22:24,347 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:24,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-01-31 17:22:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:24,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:24,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:24,897 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:24,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:24,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:24,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:24,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:24,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:24,898 INFO 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-01-31 17:22:24,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:24,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:24,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-31 17:22:24,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:24,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:26,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:27,387 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:27,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:27,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-01-31 17:22:27,407 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:27,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-31 17:22:27,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-31 17:22:27,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-01-31 17:22:27,409 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-01-31 17:22:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:34,051 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-01-31 17:22:34,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-31 17:22:34,052 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-01-31 17:22:34,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:34,054 INFO L225 Difference]: With dead ends: 230 [2019-01-31 17:22:34,054 INFO L226 Difference]: Without dead ends: 135 [2019-01-31 17:22:34,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-01-31 17:22:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-31 17:22:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-01-31 17:22:34,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-31 17:22:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-01-31 17:22:34,072 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-01-31 17:22:34,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:34,072 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-01-31 17:22:34,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-31 17:22:34,072 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-01-31 17:22:34,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-31 17:22:34,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:34,073 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-31 17:22:34,073 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:34,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:34,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-01-31 17:22:34,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:34,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:34,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:34,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:34,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:34,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:34,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:34,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:34,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:34,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:34,695 INFO 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-01-31 17:22:34,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:34,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:34,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:34,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:34,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:35,299 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:35,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:35,375 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:35,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:35,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-01-31 17:22:35,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:35,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 17:22:35,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 17:22:35,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 17:22:35,397 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-01-31 17:22:38,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:38,818 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-01-31 17:22:38,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-31 17:22:38,819 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-01-31 17:22:38,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:38,820 INFO L225 Difference]: With dead ends: 199 [2019-01-31 17:22:38,820 INFO L226 Difference]: Without dead ends: 149 [2019-01-31 17:22:38,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:22:38,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-31 17:22:38,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-01-31 17:22:38,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-31 17:22:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-01-31 17:22:38,835 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-01-31 17:22:38,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:38,835 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-01-31 17:22:38,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 17:22:38,835 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-01-31 17:22:38,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-31 17:22:38,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:38,836 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-31 17:22:38,836 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:38,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-01-31 17:22:38,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:38,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:38,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:38,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:38,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:39,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:39,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:39,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:39,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:39,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:39,182 INFO 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-01-31 17:22:39,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:39,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:39,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:39,589 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:39,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:40,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:40,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-01-31 17:22:40,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:40,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-31 17:22:40,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-31 17:22:40,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-01-31 17:22:40,452 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-01-31 17:22:41,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:41,142 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-01-31 17:22:41,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-31 17:22:41,142 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-01-31 17:22:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:41,144 INFO L225 Difference]: With dead ends: 210 [2019-01-31 17:22:41,144 INFO L226 Difference]: Without dead ends: 103 [2019-01-31 17:22:41,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-01-31 17:22:41,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-31 17:22:41,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-01-31 17:22:41,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-31 17:22:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-01-31 17:22:41,165 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-01-31 17:22:41,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:41,174 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-01-31 17:22:41,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-31 17:22:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-01-31 17:22:41,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-31 17:22:41,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:41,175 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-31 17:22:41,176 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:41,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:41,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-01-31 17:22:41,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:41,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:41,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:41,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:42,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:42,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:42,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:42,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:42,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:42,177 INFO 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-01-31 17:22:42,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:42,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:42,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-31 17:22:42,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:42,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:43,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:43,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:43,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-01-31 17:22:43,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:43,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 17:22:43,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 17:22:43,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-01-31 17:22:43,285 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-01-31 17:22:46,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:46,878 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-01-31 17:22:46,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-31 17:22:46,878 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-01-31 17:22:46,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:46,880 INFO L225 Difference]: With dead ends: 214 [2019-01-31 17:22:46,880 INFO L226 Difference]: Without dead ends: 160 [2019-01-31 17:22:46,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-01-31 17:22:46,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-31 17:22:46,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-01-31 17:22:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-31 17:22:46,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-01-31 17:22:46,897 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-01-31 17:22:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:46,898 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-01-31 17:22:46,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 17:22:46,898 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-01-31 17:22:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-31 17:22:46,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:46,898 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-31 17:22:46,898 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:46,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-01-31 17:22:46,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:46,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:46,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:46,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:46,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:47,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:47,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:47,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:47,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:47,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:47,321 INFO 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-01-31 17:22:47,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:47,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:47,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:47,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:47,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:48,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:48,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:48,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-01-31 17:22:48,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:48,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-31 17:22:48,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-31 17:22:48,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-01-31 17:22:48,347 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-01-31 17:22:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:48,979 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-01-31 17:22:48,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-31 17:22:48,980 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-01-31 17:22:48,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:48,980 INFO L225 Difference]: With dead ends: 225 [2019-01-31 17:22:48,980 INFO L226 Difference]: Without dead ends: 110 [2019-01-31 17:22:48,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-01-31 17:22:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-31 17:22:48,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-31 17:22:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-31 17:22:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-31 17:22:48,998 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-01-31 17:22:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:48,998 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-31 17:22:48,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-31 17:22:48,999 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-31 17:22:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-31 17:22:48,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:48,999 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-31 17:22:48,999 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:49,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:49,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-01-31 17:22:49,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:49,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:49,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:49,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:49,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:49,852 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:49,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:49,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:49,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:49,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:49,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:49,853 INFO 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-01-31 17:22:49,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:49,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:22:49,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:49,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:50,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:50,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:50,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-01-31 17:22:50,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:50,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 17:22:50,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 17:22:50,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 17:22:50,686 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-01-31 17:22:55,581 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-31 17:22:55,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:55,906 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-01-31 17:22:55,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-31 17:22:55,906 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-01-31 17:22:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:55,908 INFO L225 Difference]: With dead ends: 229 [2019-01-31 17:22:55,908 INFO L226 Difference]: Without dead ends: 171 [2019-01-31 17:22:55,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 17:22:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-31 17:22:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-01-31 17:22:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-31 17:22:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-01-31 17:22:55,933 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-01-31 17:22:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:55,933 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-01-31 17:22:55,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 17:22:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-01-31 17:22:55,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-31 17:22:55,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:55,934 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-31 17:22:55,935 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:55,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:55,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-01-31 17:22:55,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:55,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:55,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:22:55,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:55,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:56,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:56,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:56,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:56,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:56,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:56,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:22:56,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:22:56,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:22:56,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-31 17:22:56,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:56,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:22:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:57,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:22:57,345 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:57,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:22:57,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-01-31 17:22:57,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:22:57,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-31 17:22:57,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-31 17:22:57,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-01-31 17:22:57,366 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-01-31 17:22:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:22:58,127 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-01-31 17:22:58,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-31 17:22:58,127 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-01-31 17:22:58,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:22:58,129 INFO L225 Difference]: With dead ends: 240 [2019-01-31 17:22:58,129 INFO L226 Difference]: Without dead ends: 117 [2019-01-31 17:22:58,131 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-01-31 17:22:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-31 17:22:58,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-31 17:22:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-31 17:22:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-01-31 17:22:58,152 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-01-31 17:22:58,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:22:58,153 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-01-31 17:22:58,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-31 17:22:58,153 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-01-31 17:22:58,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-31 17:22:58,154 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:22:58,154 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-31 17:22:58,154 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:22:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:22:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-01-31 17:22:58,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:22:58,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:58,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:22:58,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:22:58,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:22:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:22:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:22:59,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:59,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:22:59,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:22:59,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:22:59,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:22:59,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 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-01-31 17:22:59,071 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:22:59,071 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:22:59,103 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:22:59,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:22:59,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:00,132 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:00,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:00,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:00,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-01-31 17:23:00,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:00,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 17:23:00,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 17:23:00,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-01-31 17:23:00,263 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-01-31 17:23:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:05,601 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-01-31 17:23:05,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-31 17:23:05,604 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-01-31 17:23:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:05,606 INFO L225 Difference]: With dead ends: 244 [2019-01-31 17:23:05,606 INFO L226 Difference]: Without dead ends: 182 [2019-01-31 17:23:05,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-01-31 17:23:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-31 17:23:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-01-31 17:23:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-31 17:23:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-01-31 17:23:05,630 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-01-31 17:23:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:05,631 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-01-31 17:23:05,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 17:23:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-01-31 17:23:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-31 17:23:05,632 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:05,632 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-31 17:23:05,632 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:05,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-01-31 17:23:05,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:05,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:05,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:05,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:05,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:06,890 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:06,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:06,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:06,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:06,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:06,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:06,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:23:06,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:06,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:06,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:07,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:07,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:07,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-01-31 17:23:07,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:07,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-31 17:23:07,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-31 17:23:07,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-01-31 17:23:07,915 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-01-31 17:23:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:08,994 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-01-31 17:23:08,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-31 17:23:08,995 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-01-31 17:23:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:08,996 INFO L225 Difference]: With dead ends: 255 [2019-01-31 17:23:08,996 INFO L226 Difference]: Without dead ends: 124 [2019-01-31 17:23:08,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-01-31 17:23:08,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-31 17:23:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-31 17:23:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-31 17:23:09,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-01-31 17:23:09,015 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-01-31 17:23:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:09,015 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-01-31 17:23:09,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-31 17:23:09,015 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-01-31 17:23:09,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-31 17:23:09,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:09,016 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-31 17:23:09,016 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:09,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:09,017 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-01-31 17:23:09,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:09,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:09,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:09,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:09,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:10,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:10,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:10,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:10,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:10,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:10,340 INFO 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-01-31 17:23:10,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:10,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:10,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-31 17:23:10,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:10,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:12,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:14,423 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:14,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:14,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-01-31 17:23:14,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:14,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-31 17:23:14,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-31 17:23:14,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:23:14,444 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-01-31 17:23:23,269 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-01-31 17:23:23,542 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-31 17:23:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:25,082 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-01-31 17:23:25,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-31 17:23:25,082 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-01-31 17:23:25,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:25,083 INFO L225 Difference]: With dead ends: 325 [2019-01-31 17:23:25,084 INFO L226 Difference]: Without dead ends: 190 [2019-01-31 17:23:25,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-01-31 17:23:25,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-31 17:23:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-01-31 17:23:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-31 17:23:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-31 17:23:25,105 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-01-31 17:23:25,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:25,106 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-31 17:23:25,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-31 17:23:25,106 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-31 17:23:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-31 17:23:25,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:25,107 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-31 17:23:25,107 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:25,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:25,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-01-31 17:23:25,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:25,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:25,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:25,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:25,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:26,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:26,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:26,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:26,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:26,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:26,189 INFO 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-01-31 17:23:26,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:26,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:26,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:26,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:26,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:27,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:27,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:27,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-01-31 17:23:27,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:27,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-31 17:23:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-31 17:23:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-01-31 17:23:27,313 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-01-31 17:23:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:33,257 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-01-31 17:23:33,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-31 17:23:33,258 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-01-31 17:23:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:33,259 INFO L225 Difference]: With dead ends: 274 [2019-01-31 17:23:33,259 INFO L226 Difference]: Without dead ends: 204 [2019-01-31 17:23:33,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-01-31 17:23:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-31 17:23:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-01-31 17:23:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-31 17:23:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-01-31 17:23:33,283 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-01-31 17:23:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:33,283 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-01-31 17:23:33,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-31 17:23:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-01-31 17:23:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-31 17:23:33,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:33,284 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-31 17:23:33,285 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:33,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-01-31 17:23:33,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:33,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:33,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:33,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:33,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:34,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:34,124 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:34,124 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:34,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:34,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:34,124 INFO 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-01-31 17:23:34,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:34,136 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:23:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:34,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:34,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:34,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:35,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:35,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-01-31 17:23:35,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:35,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-31 17:23:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-31 17:23:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-01-31 17:23:35,329 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-01-31 17:23:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:36,253 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-01-31 17:23:36,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-31 17:23:36,253 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-01-31 17:23:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:36,255 INFO L225 Difference]: With dead ends: 285 [2019-01-31 17:23:36,255 INFO L226 Difference]: Without dead ends: 138 [2019-01-31 17:23:36,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-01-31 17:23:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-31 17:23:36,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-01-31 17:23:36,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-31 17:23:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-01-31 17:23:36,285 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-01-31 17:23:36,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:36,285 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-01-31 17:23:36,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-31 17:23:36,285 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-01-31 17:23:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-31 17:23:36,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:36,286 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-31 17:23:36,287 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:36,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:36,287 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-01-31 17:23:36,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:36,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:23:36,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:36,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:37,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:37,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:37,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:37,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:37,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:37,344 INFO 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-01-31 17:23:37,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:23:37,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:23:37,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-31 17:23:37,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:37,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:40,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:42,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:42,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:42,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-01-31 17:23:42,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:42,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-31 17:23:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-31 17:23:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-01-31 17:23:42,387 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-01-31 17:23:53,643 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-31 17:23:53,961 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-31 17:23:56,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:23:56,705 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-01-31 17:23:56,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-31 17:23:56,705 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-01-31 17:23:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:23:56,707 INFO L225 Difference]: With dead ends: 363 [2019-01-31 17:23:56,707 INFO L226 Difference]: Without dead ends: 212 [2019-01-31 17:23:56,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-01-31 17:23:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-31 17:23:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-01-31 17:23:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-31 17:23:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-01-31 17:23:56,731 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-01-31 17:23:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:23:56,732 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-01-31 17:23:56,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-31 17:23:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-01-31 17:23:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-31 17:23:56,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:23:56,733 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-31 17:23:56,733 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:23:56,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:23:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-01-31 17:23:56,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:23:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:56,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:23:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:23:56,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:23:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:23:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:58,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:58,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:23:58,084 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:23:58,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:23:58,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:23:58,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:23:58,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:23:58,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:23:58,132 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:23:58,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:23:58,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:23:59,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:59,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:23:59,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:23:59,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:23:59,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-01-31 17:23:59,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:23:59,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-31 17:23:59,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-31 17:23:59,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-01-31 17:23:59,711 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-01-31 17:24:04,062 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-31 17:24:04,415 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-31 17:24:04,722 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-31 17:24:04,919 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:24:06,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:06,665 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-01-31 17:24:06,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-31 17:24:06,665 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-01-31 17:24:06,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:06,666 INFO L225 Difference]: With dead ends: 304 [2019-01-31 17:24:06,666 INFO L226 Difference]: Without dead ends: 226 [2019-01-31 17:24:06,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-01-31 17:24:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-31 17:24:06,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-01-31 17:24:06,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-31 17:24:06,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-01-31 17:24:06,704 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-01-31 17:24:06,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:06,705 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-01-31 17:24:06,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-31 17:24:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-01-31 17:24:06,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-31 17:24:06,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:06,708 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-31 17:24:06,708 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:06,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:06,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-01-31 17:24:06,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:06,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:06,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:06,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:06,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:07,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:07,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:07,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:07,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:07,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:07,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:24:07,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:07,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:24:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:07,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:08,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:09,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:09,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-01-31 17:24:09,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:09,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-31 17:24:09,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-31 17:24:09,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-01-31 17:24:09,253 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-01-31 17:24:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:10,843 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-01-31 17:24:10,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-31 17:24:10,843 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-01-31 17:24:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:10,844 INFO L225 Difference]: With dead ends: 315 [2019-01-31 17:24:10,844 INFO L226 Difference]: Without dead ends: 152 [2019-01-31 17:24:10,846 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-01-31 17:24:10,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-31 17:24:10,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-31 17:24:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-31 17:24:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-01-31 17:24:10,880 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-01-31 17:24:10,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:10,880 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-01-31 17:24:10,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-31 17:24:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-01-31 17:24:10,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-31 17:24:10,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:10,881 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-31 17:24:10,881 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:10,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:10,882 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-01-31 17:24:10,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:10,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:10,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:10,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:12,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:12,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:12,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:12,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:12,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:12,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:24:12,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:24:12,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:24:12,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-31 17:24:12,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:12,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:15,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:18,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:18,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-01-31 17:24:18,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:18,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-31 17:24:18,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-31 17:24:18,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 17:24:18,277 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-01-31 17:24:30,617 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-31 17:24:30,962 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-31 17:24:31,277 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-31 17:24:31,553 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:24:31,826 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:24:34,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:34,307 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-01-31 17:24:34,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-01-31 17:24:34,307 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-01-31 17:24:34,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:34,309 INFO L225 Difference]: With dead ends: 401 [2019-01-31 17:24:34,309 INFO L226 Difference]: Without dead ends: 234 [2019-01-31 17:24:34,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-01-31 17:24:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-31 17:24:34,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-01-31 17:24:34,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-31 17:24:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-01-31 17:24:34,344 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-01-31 17:24:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:34,344 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-01-31 17:24:34,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-31 17:24:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-01-31 17:24:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-31 17:24:34,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:34,346 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-31 17:24:34,346 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:34,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-01-31 17:24:34,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:34,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:34,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:34,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:34,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:36,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:36,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:36,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:36,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:36,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:36,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:36,257 INFO 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-01-31 17:24:36,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:24:36,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:24:36,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:24:36,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:36,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:37,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:38,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:38,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-01-31 17:24:38,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:38,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-31 17:24:38,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-31 17:24:38,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-01-31 17:24:38,077 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-01-31 17:24:44,145 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-31 17:24:44,467 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-31 17:24:44,778 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-31 17:24:44,989 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:24:45,227 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:24:45,459 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:24:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:47,375 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-01-31 17:24:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-31 17:24:47,376 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-01-31 17:24:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:47,378 INFO L225 Difference]: With dead ends: 334 [2019-01-31 17:24:47,378 INFO L226 Difference]: Without dead ends: 248 [2019-01-31 17:24:47,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-01-31 17:24:47,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-31 17:24:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-01-31 17:24:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-31 17:24:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-01-31 17:24:47,417 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-01-31 17:24:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:47,418 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-01-31 17:24:47,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-31 17:24:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-01-31 17:24:47,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-31 17:24:47,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:47,419 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-31 17:24:47,419 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:47,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:47,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-01-31 17:24:47,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:47,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:47,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:24:47,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:47,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:48,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:48,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:48,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:48,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:48,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:48,723 INFO 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-01-31 17:24:48,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:48,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:24:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:48,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:49,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:50,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:50,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-01-31 17:24:50,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:50,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-31 17:24:50,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-31 17:24:50,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-01-31 17:24:50,570 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-01-31 17:24:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:24:52,287 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-01-31 17:24:52,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-31 17:24:52,289 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-01-31 17:24:52,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:24:52,291 INFO L225 Difference]: With dead ends: 345 [2019-01-31 17:24:52,291 INFO L226 Difference]: Without dead ends: 166 [2019-01-31 17:24:52,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-01-31 17:24:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-31 17:24:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-01-31 17:24:52,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-31 17:24:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-01-31 17:24:52,319 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-01-31 17:24:52,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:24:52,319 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-01-31 17:24:52,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-31 17:24:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-01-31 17:24:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-31 17:24:52,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:24:52,320 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-31 17:24:52,320 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:24:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:24:52,320 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-01-31 17:24:52,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:24:52,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:52,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:24:52,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:24:52,322 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:24:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:24:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:54,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:54,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:24:54,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:24:54,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:24:54,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:24:54,503 INFO 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-01-31 17:24:54,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:24:54,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:24:54,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-31 17:24:54,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:24:54,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:24:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:56,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:24:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:24:56,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:24:56,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-01-31 17:24:56,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:24:56,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-31 17:24:56,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-31 17:24:56,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 17:24:56,443 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-01-31 17:25:03,745 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-31 17:25:04,090 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-31 17:25:04,419 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-31 17:25:04,641 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:25:04,856 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:25:05,056 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:25:05,254 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:25:05,657 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-31 17:25:05,880 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-31 17:25:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:07,288 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-01-31 17:25:07,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-31 17:25:07,288 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-01-31 17:25:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:07,290 INFO L225 Difference]: With dead ends: 349 [2019-01-31 17:25:07,290 INFO L226 Difference]: Without dead ends: 259 [2019-01-31 17:25:07,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-01-31 17:25:07,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-31 17:25:07,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-01-31 17:25:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-31 17:25:07,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-01-31 17:25:07,322 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-01-31 17:25:07,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:07,323 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-01-31 17:25:07,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-31 17:25:07,323 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-01-31 17:25:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-31 17:25:07,324 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:07,324 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-31 17:25:07,324 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:07,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:07,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-01-31 17:25:07,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:07,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:07,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:07,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:07,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:08,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:08,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:08,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:08,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:08,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:08,693 INFO 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-01-31 17:25:08,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:25:08,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:25:08,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:25:08,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:08,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:09,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:10,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-01-31 17:25:10,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:10,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-01-31 17:25:10,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:10,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-31 17:25:10,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-31 17:25:10,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-01-31 17:25:10,555 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-01-31 17:25:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:12,648 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-01-31 17:25:12,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-31 17:25:12,648 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-01-31 17:25:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:12,650 INFO L225 Difference]: With dead ends: 360 [2019-01-31 17:25:12,650 INFO L226 Difference]: Without dead ends: 173 [2019-01-31 17:25:12,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-01-31 17:25:12,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-31 17:25:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-31 17:25:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-31 17:25:12,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-01-31 17:25:12,681 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-01-31 17:25:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:12,682 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-01-31 17:25:12,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-31 17:25:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-01-31 17:25:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-31 17:25:12,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:12,683 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-31 17:25:12,683 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:12,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-01-31 17:25:12,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:12,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:12,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:12,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:14,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:14,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:14,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:14,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:14,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:14,378 INFO 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-01-31 17:25:14,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:14,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:25:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:14,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:16,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:16,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:16,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:16,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-01-31 17:25:16,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:16,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-31 17:25:16,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-31 17:25:16,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-01-31 17:25:16,674 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-01-31 17:25:24,442 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-31 17:25:24,819 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-31 17:25:25,170 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-31 17:25:25,399 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:25:25,621 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:25:25,838 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:25:26,058 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:25:26,318 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:25:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:28,366 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-01-31 17:25:28,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-31 17:25:28,367 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-01-31 17:25:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:28,368 INFO L225 Difference]: With dead ends: 364 [2019-01-31 17:25:28,368 INFO L226 Difference]: Without dead ends: 270 [2019-01-31 17:25:28,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-01-31 17:25:28,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-31 17:25:28,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-01-31 17:25:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-31 17:25:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-01-31 17:25:28,401 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-01-31 17:25:28,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:28,401 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-01-31 17:25:28,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-31 17:25:28,401 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-01-31 17:25:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-31 17:25:28,402 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:28,402 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-31 17:25:28,403 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:28,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:28,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-01-31 17:25:28,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:28,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:28,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:28,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:28,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:30,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:30,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:30,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:30,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:30,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:30,239 INFO 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-01-31 17:25:30,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:25:30,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:25:30,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-31 17:25:30,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:30,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:32,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:32,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:32,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-01-31 17:25:32,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:32,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-31 17:25:32,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-31 17:25:32,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-01-31 17:25:32,913 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-01-31 17:25:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:34,821 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-01-31 17:25:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-31 17:25:34,821 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-01-31 17:25:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:34,823 INFO L225 Difference]: With dead ends: 375 [2019-01-31 17:25:34,823 INFO L226 Difference]: Without dead ends: 180 [2019-01-31 17:25:34,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-01-31 17:25:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-31 17:25:34,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-31 17:25:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-31 17:25:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-01-31 17:25:34,867 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-01-31 17:25:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:34,867 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-01-31 17:25:34,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-31 17:25:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-01-31 17:25:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-31 17:25:34,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:34,868 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-31 17:25:34,868 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:34,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-01-31 17:25:34,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:34,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:34,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:34,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:34,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:37,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:37,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:37,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:37,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:37,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:37,437 INFO 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-01-31 17:25:37,447 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:25:37,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:25:37,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:25:37,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:37,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:39,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:39,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:39,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:39,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-01-31 17:25:39,411 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:39,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-31 17:25:39,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-31 17:25:39,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 17:25:39,412 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-01-31 17:25:45,990 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-31 17:25:46,372 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-31 17:25:46,793 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-31 17:25:47,060 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:25:47,306 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:25:47,540 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:25:47,763 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:25:47,993 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:25:48,198 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:25:48,603 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-31 17:25:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:50,333 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-01-31 17:25:50,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-31 17:25:50,334 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-01-31 17:25:50,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:50,335 INFO L225 Difference]: With dead ends: 379 [2019-01-31 17:25:50,335 INFO L226 Difference]: Without dead ends: 281 [2019-01-31 17:25:50,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-01-31 17:25:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-31 17:25:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-01-31 17:25:50,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-31 17:25:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-01-31 17:25:50,387 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-01-31 17:25:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:50,388 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-01-31 17:25:50,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-31 17:25:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-01-31 17:25:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-31 17:25:50,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:50,389 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-31 17:25:50,390 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:50,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-01-31 17:25:50,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:50,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:25:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:50,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:51,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:51,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:51,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:51,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:51,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:51,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:51,492 INFO 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-01-31 17:25:51,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:51,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:25:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:51,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:25:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:52,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:25:53,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:53,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:25:53,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-01-31 17:25:53,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:25:53,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-31 17:25:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-31 17:25:53,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-01-31 17:25:53,848 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-01-31 17:25:55,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:25:55,912 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-01-31 17:25:55,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-31 17:25:55,912 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-01-31 17:25:55,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:25:55,914 INFO L225 Difference]: With dead ends: 390 [2019-01-31 17:25:55,914 INFO L226 Difference]: Without dead ends: 187 [2019-01-31 17:25:55,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-01-31 17:25:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-31 17:25:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-31 17:25:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-31 17:25:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-01-31 17:25:55,955 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-01-31 17:25:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:25:55,955 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-01-31 17:25:55,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-31 17:25:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-01-31 17:25:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-31 17:25:55,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:25:55,956 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-31 17:25:55,956 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:25:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:25:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-01-31 17:25:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:25:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:55,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:25:55,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:25:55,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:25:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:25:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:25:58,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:58,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:25:58,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:25:58,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:25:58,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:25:58,690 INFO 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-01-31 17:25:58,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:25:58,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:25:58,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-31 17:25:58,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:25:58,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:03,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:03,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:07,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:07,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-01-31 17:26:07,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:07,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-31 17:26:07,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-31 17:26:07,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-01-31 17:26:07,874 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-01-31 17:26:26,601 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-31 17:26:27,061 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-31 17:26:27,595 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-31 17:26:28,023 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:26:28,408 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:26:28,819 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:26:29,171 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:26:29,522 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:26:29,848 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:26:30,166 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:26:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:33,261 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-01-31 17:26:33,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-01-31 17:26:33,262 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-01-31 17:26:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:33,264 INFO L225 Difference]: With dead ends: 496 [2019-01-31 17:26:33,264 INFO L226 Difference]: Without dead ends: 289 [2019-01-31 17:26:33,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 30.1s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-01-31 17:26:33,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-31 17:26:33,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-01-31 17:26:33,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-31 17:26:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-01-31 17:26:33,306 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-01-31 17:26:33,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:33,306 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-01-31 17:26:33,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-31 17:26:33,306 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-01-31 17:26:33,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-31 17:26:33,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:33,307 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-31 17:26:33,307 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:33,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:33,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-01-31 17:26:33,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:33,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:33,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:33,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:35,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:35,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:35,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:35,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:35,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:35,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:35,245 INFO 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-01-31 17:26:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:26:35,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:26:35,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:26:35,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:26:35,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:37,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:37,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:37,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-01-31 17:26:37,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:37,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-31 17:26:37,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-31 17:26:37,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 17:26:37,833 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-01-31 17:26:46,803 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-31 17:26:47,235 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-31 17:26:47,686 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-31 17:26:47,980 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:26:48,318 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:26:48,594 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:26:48,852 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:26:49,097 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:26:49,338 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:26:49,564 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:26:49,788 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:26:52,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:26:52,030 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-01-31 17:26:52,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-31 17:26:52,031 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-01-31 17:26:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:26:52,032 INFO L225 Difference]: With dead ends: 409 [2019-01-31 17:26:52,032 INFO L226 Difference]: Without dead ends: 303 [2019-01-31 17:26:52,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-01-31 17:26:52,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-31 17:26:52,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-01-31 17:26:52,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-31 17:26:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-01-31 17:26:52,071 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-01-31 17:26:52,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:26:52,072 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-01-31 17:26:52,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-31 17:26:52,072 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-01-31 17:26:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-31 17:26:52,072 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:26:52,073 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-31 17:26:52,073 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:26:52,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:26:52,073 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-01-31 17:26:52,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:26:52,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:52,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:26:52,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:26:52,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:26:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:53,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:53,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:26:53,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:26:53,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:26:53,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:26:53,326 INFO 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-01-31 17:26:53,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:26:53,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:26:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:26:53,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:26:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:26:57,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:26:57,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-01-31 17:26:57,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:26:57,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-01-31 17:26:57,994 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:26:57,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-31 17:26:57,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-31 17:26:57,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-01-31 17:26:57,995 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-01-31 17:27:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:00,607 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-01-31 17:27:00,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-31 17:27:00,608 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-01-31 17:27:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:00,609 INFO L225 Difference]: With dead ends: 420 [2019-01-31 17:27:00,609 INFO L226 Difference]: Without dead ends: 201 [2019-01-31 17:27:00,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-01-31 17:27:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-31 17:27:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-31 17:27:00,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-31 17:27:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-01-31 17:27:00,650 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-01-31 17:27:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:00,650 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-01-31 17:27:00,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-31 17:27:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-01-31 17:27:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-31 17:27:00,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:00,651 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-31 17:27:00,651 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:00,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-01-31 17:27:00,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:00,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:00,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:00,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:00,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:02,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:02,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:02,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:02,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:02,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:02,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:02,535 INFO 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-01-31 17:27:02,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:27:02,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:27:02,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-31 17:27:02,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:02,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:04,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:05,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:05,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-01-31 17:27:05,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:05,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-31 17:27:05,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-31 17:27:05,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-01-31 17:27:05,008 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-01-31 17:27:13,798 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-31 17:27:14,337 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-31 17:27:14,753 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-31 17:27:15,044 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:27:15,326 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:27:15,607 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:27:15,878 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:27:16,137 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:27:16,392 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:27:16,634 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:27:16,863 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:27:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:19,463 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-01-31 17:27:19,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-01-31 17:27:19,464 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-01-31 17:27:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:19,466 INFO L225 Difference]: With dead ends: 424 [2019-01-31 17:27:19,466 INFO L226 Difference]: Without dead ends: 314 [2019-01-31 17:27:19,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-01-31 17:27:19,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-31 17:27:19,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-01-31 17:27:19,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-31 17:27:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-01-31 17:27:19,513 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-01-31 17:27:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:19,514 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-01-31 17:27:19,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-31 17:27:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-01-31 17:27:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-31 17:27:19,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:19,515 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-31 17:27:19,515 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-01-31 17:27:19,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:19,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:19,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:19,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:20,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:20,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:20,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:20,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:20,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:20,679 INFO 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-01-31 17:27:20,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:27:20,688 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:27:20,718 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:27:20,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:20,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:22,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:23,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:23,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-01-31 17:27:23,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:23,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-31 17:27:23,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-31 17:27:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-01-31 17:27:23,124 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-01-31 17:27:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:25,829 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-01-31 17:27:25,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-31 17:27:25,830 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-01-31 17:27:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:25,832 INFO L225 Difference]: With dead ends: 435 [2019-01-31 17:27:25,832 INFO L226 Difference]: Without dead ends: 208 [2019-01-31 17:27:25,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-01-31 17:27:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-31 17:27:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-01-31 17:27:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-31 17:27:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-01-31 17:27:25,882 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-01-31 17:27:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:25,882 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-01-31 17:27:25,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-31 17:27:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-01-31 17:27:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-31 17:27:25,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:25,883 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-31 17:27:25,884 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:25,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-01-31 17:27:25,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:25,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:25,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:25,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:25,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:27,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:27,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:27,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:27,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:27,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:27,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:27,892 INFO 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-01-31 17:27:27,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:27,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:27:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:27,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:30,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:30,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:30,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-01-31 17:27:30,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:30,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-31 17:27:30,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-31 17:27:30,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 17:27:30,483 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-01-31 17:27:39,760 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-31 17:27:40,203 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-31 17:27:40,636 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-31 17:27:40,957 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:27:41,270 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:27:41,556 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:27:41,839 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:27:42,113 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:27:42,379 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:27:42,633 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:27:42,884 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:27:43,122 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:27:45,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:45,727 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-01-31 17:27:45,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-01-31 17:27:45,727 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-01-31 17:27:45,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:45,729 INFO L225 Difference]: With dead ends: 439 [2019-01-31 17:27:45,729 INFO L226 Difference]: Without dead ends: 325 [2019-01-31 17:27:45,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 17:27:45,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-31 17:27:45,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-01-31 17:27:45,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-31 17:27:45,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-01-31 17:27:45,791 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-01-31 17:27:45,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:45,792 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-01-31 17:27:45,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-31 17:27:45,792 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-01-31 17:27:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-31 17:27:45,793 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:45,793 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-31 17:27:45,794 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:45,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:45,794 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-01-31 17:27:45,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:27:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:45,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:47,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:47,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:47,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:47,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:47,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:47,019 INFO 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-01-31 17:27:47,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:27:47,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:27:47,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-31 17:27:47,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:47,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:48,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:50,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:50,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-01-31 17:27:50,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:50,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-31 17:27:50,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-31 17:27:50,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-01-31 17:27:50,293 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-01-31 17:27:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:27:53,015 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-01-31 17:27:53,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-31 17:27:53,016 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-01-31 17:27:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:27:53,018 INFO L225 Difference]: With dead ends: 450 [2019-01-31 17:27:53,018 INFO L226 Difference]: Without dead ends: 215 [2019-01-31 17:27:53,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-01-31 17:27:53,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-31 17:27:53,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-01-31 17:27:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-31 17:27:53,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-01-31 17:27:53,088 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-01-31 17:27:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:27:53,088 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-01-31 17:27:53,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-31 17:27:53,088 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-01-31 17:27:53,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-31 17:27:53,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:27:53,090 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-31 17:27:53,090 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:27:53,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:27:53,090 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-01-31 17:27:53,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:27:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:53,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:27:53,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:27:53,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:27:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:27:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:55,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:55,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:27:55,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:27:55,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:27:55,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:27:55,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:27:55,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:27:55,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:27:55,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:27:55,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:27:55,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:27:57,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:57,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:27:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:27:57,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:27:57,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-01-31 17:27:57,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:27:57,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-31 17:27:57,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-31 17:27:57,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-01-31 17:27:57,967 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-01-31 17:28:08,713 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-31 17:28:09,182 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-31 17:28:09,645 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-31 17:28:09,985 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-31 17:28:10,332 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:28:10,662 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:28:10,961 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:28:11,250 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:28:11,524 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:28:11,787 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:28:12,043 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:28:12,289 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:28:12,530 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:28:12,982 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-31 17:28:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:15,157 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-01-31 17:28:15,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-01-31 17:28:15,157 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-01-31 17:28:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:15,159 INFO L225 Difference]: With dead ends: 454 [2019-01-31 17:28:15,159 INFO L226 Difference]: Without dead ends: 336 [2019-01-31 17:28:15,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-01-31 17:28:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-31 17:28:15,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-01-31 17:28:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-31 17:28:15,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-01-31 17:28:15,212 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-01-31 17:28:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:15,212 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-01-31 17:28:15,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-31 17:28:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-01-31 17:28:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-31 17:28:15,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:15,213 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-31 17:28:15,214 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:15,214 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-01-31 17:28:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:15,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:28:15,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:15,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:16,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:16,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:16,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:16,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:16,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:16,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:16,542 INFO 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-01-31 17:28:16,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:28:16,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:28:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:16,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:18,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:19,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:19,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-01-31 17:28:19,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:19,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-31 17:28:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-31 17:28:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-01-31 17:28:19,333 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-01-31 17:28:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:28:22,374 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-01-31 17:28:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-31 17:28:22,374 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-01-31 17:28:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:28:22,375 INFO L225 Difference]: With dead ends: 465 [2019-01-31 17:28:22,375 INFO L226 Difference]: Without dead ends: 222 [2019-01-31 17:28:22,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-01-31 17:28:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-31 17:28:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-01-31 17:28:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-31 17:28:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-01-31 17:28:22,422 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-01-31 17:28:22,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:28:22,423 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-01-31 17:28:22,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-31 17:28:22,423 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-01-31 17:28:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-31 17:28:22,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:28:22,424 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-31 17:28:22,424 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:28:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:28:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-01-31 17:28:22,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:28:22,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:22,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:28:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:28:22,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:28:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:28:24,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:24,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:24,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:28:24,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:28:24,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:28:24,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:28:24,693 INFO 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-01-31 17:28:24,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:28:24,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:28:24,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-31 17:28:24,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:28:24,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:28:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:31,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:28:36,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:28:36,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:28:36,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-01-31 17:28:36,819 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:28:36,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-31 17:28:36,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-31 17:28:36,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-01-31 17:28:36,821 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-01-31 17:29:01,941 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-31 17:29:02,532 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-31 17:29:03,155 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-31 17:29:03,671 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-31 17:29:04,157 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-31 17:29:04,694 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:29:05,168 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:29:05,617 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:29:06,049 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:29:06,552 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:29:06,988 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:29:07,384 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:29:07,767 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:29:08,126 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:29:12,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:12,034 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-01-31 17:29:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-01-31 17:29:12,034 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-01-31 17:29:12,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:12,036 INFO L225 Difference]: With dead ends: 591 [2019-01-31 17:29:12,036 INFO L226 Difference]: Without dead ends: 344 [2019-01-31 17:29:12,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-01-31 17:29:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-31 17:29:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-01-31 17:29:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-31 17:29:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-01-31 17:29:12,086 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-01-31 17:29:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:12,086 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-01-31 17:29:12,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-31 17:29:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-01-31 17:29:12,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-31 17:29:12,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:12,087 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-01-31 17:29:12,088 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:12,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-01-31 17:29:12,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:12,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:12,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:12,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:12,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:14,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:14,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:14,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:14,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:14,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:14,484 INFO 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-01-31 17:29:14,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:29:14,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:29:14,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:29:14,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:14,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:17,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:17,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:17,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-01-31 17:29:17,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:17,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-31 17:29:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-31 17:29:17,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-01-31 17:29:17,532 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-01-31 17:29:30,696 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-31 17:29:31,207 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-31 17:29:31,722 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-31 17:29:32,138 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-31 17:29:32,486 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-31 17:29:32,814 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-31 17:29:33,138 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:29:33,460 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:29:33,774 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:29:34,110 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:29:34,396 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:29:34,676 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:29:34,940 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:29:35,218 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:29:35,475 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:29:35,728 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:29:38,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:38,334 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-01-31 17:29:38,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-01-31 17:29:38,334 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-01-31 17:29:38,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:38,335 INFO L225 Difference]: With dead ends: 484 [2019-01-31 17:29:38,336 INFO L226 Difference]: Without dead ends: 358 [2019-01-31 17:29:38,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-01-31 17:29:38,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-31 17:29:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-01-31 17:29:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-31 17:29:38,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-01-31 17:29:38,391 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-01-31 17:29:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:38,391 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-01-31 17:29:38,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-31 17:29:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-01-31 17:29:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-31 17:29:38,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:38,392 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-31 17:29:38,393 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:38,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-01-31 17:29:38,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:38,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:38,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:29:38,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:38,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:40,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:40,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:40,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:40,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:40,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:40,017 INFO 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-01-31 17:29:40,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:29:40,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:29:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:40,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:41,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:29:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:43,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:29:43,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-01-31 17:29:43,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:29:43,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-31 17:29:43,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-31 17:29:43,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-01-31 17:29:43,714 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-01-31 17:29:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:29:46,145 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-01-31 17:29:46,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-31 17:29:46,146 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-01-31 17:29:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:29:46,147 INFO L225 Difference]: With dead ends: 495 [2019-01-31 17:29:46,148 INFO L226 Difference]: Without dead ends: 236 [2019-01-31 17:29:46,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-01-31 17:29:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-31 17:29:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-01-31 17:29:46,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-31 17:29:46,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-01-31 17:29:46,205 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-01-31 17:29:46,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:29:46,205 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-01-31 17:29:46,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-31 17:29:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-01-31 17:29:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-31 17:29:46,207 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:29:46,207 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-31 17:29:46,207 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:29:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:29:46,208 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-01-31 17:29:46,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:29:46,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:46,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:29:46,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:29:46,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:29:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:29:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:49,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:49,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:29:49,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:29:49,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:29:49,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:29:49,059 INFO 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-01-31 17:29:49,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:29:49,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:29:49,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-31 17:29:49,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:29:49,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:29:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:29:56,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:03,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:03,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:03,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-01-31 17:30:03,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:03,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-31 17:30:03,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-31 17:30:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-01-31 17:30:03,115 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-01-31 17:30:29,350 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-31 17:30:29,981 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-31 17:30:30,620 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-31 17:30:31,197 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-31 17:30:31,750 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-31 17:30:32,288 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-31 17:30:32,814 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-31 17:30:33,353 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:30:33,863 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:30:34,384 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:30:34,852 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:30:35,299 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:30:35,732 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:30:36,150 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:30:36,555 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:30:36,943 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:30:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:30:40,986 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-01-31 17:30:40,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-01-31 17:30:40,986 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-01-31 17:30:40,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:30:40,988 INFO L225 Difference]: With dead ends: 629 [2019-01-31 17:30:40,988 INFO L226 Difference]: Without dead ends: 366 [2019-01-31 17:30:40,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-01-31 17:30:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-31 17:30:41,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-01-31 17:30:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-31 17:30:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-01-31 17:30:41,045 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-01-31 17:30:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:30:41,045 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-01-31 17:30:41,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-31 17:30:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-01-31 17:30:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-31 17:30:41,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:30:41,046 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-01-31 17:30:41,046 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:30:41,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:30:41,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-01-31 17:30:41,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:30:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:41,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:30:41,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:30:41,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:30:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:30:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:43,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:43,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:30:43,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:30:43,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:30:43,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:30:43,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:30:43,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:30:43,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:30:43,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:30:43,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:30:43,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:30:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:46,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:30:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:30:47,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:30:47,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-01-31 17:30:47,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:30:47,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-31 17:30:47,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-31 17:30:47,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-01-31 17:30:47,049 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-01-31 17:30:59,784 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-31 17:31:00,368 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-31 17:31:00,933 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-31 17:31:01,331 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-31 17:31:01,704 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-31 17:31:02,079 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-31 17:31:02,440 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-31 17:31:02,786 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-31 17:31:03,133 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:31:03,475 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:31:03,795 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:31:04,167 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:31:04,484 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:31:04,782 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:31:05,067 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:31:05,340 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:31:05,602 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:31:05,865 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-31 17:31:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:08,584 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-01-31 17:31:08,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-01-31 17:31:08,585 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-01-31 17:31:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:08,587 INFO L225 Difference]: With dead ends: 514 [2019-01-31 17:31:08,587 INFO L226 Difference]: Without dead ends: 380 [2019-01-31 17:31:08,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-01-31 17:31:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-31 17:31:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-01-31 17:31:08,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-31 17:31:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-01-31 17:31:08,648 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-01-31 17:31:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:08,648 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-01-31 17:31:08,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-31 17:31:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-01-31 17:31:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-31 17:31:08,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:08,649 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-31 17:31:08,649 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:08,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:08,649 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-01-31 17:31:08,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:08,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:08,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:31:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:08,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:10,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:10,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:10,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:10,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:10,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:10,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:31:10,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:31:10,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:31:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:10,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:12,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:14,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:14,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-01-31 17:31:14,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:14,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-31 17:31:14,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-31 17:31:14,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-01-31 17:31:14,078 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-01-31 17:31:16,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:31:16,898 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-01-31 17:31:16,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-31 17:31:16,898 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-01-31 17:31:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:31:16,900 INFO L225 Difference]: With dead ends: 525 [2019-01-31 17:31:16,900 INFO L226 Difference]: Without dead ends: 250 [2019-01-31 17:31:16,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-01-31 17:31:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-31 17:31:16,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-31 17:31:16,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-31 17:31:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-01-31 17:31:16,965 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-01-31 17:31:16,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:31:16,965 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-01-31 17:31:16,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-31 17:31:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-01-31 17:31:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-31 17:31:16,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:31:16,967 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-31 17:31:16,967 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:31:16,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:31:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-01-31 17:31:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:31:16,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:16,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:31:16,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:31:16,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:31:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:31:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:20,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:20,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:31:20,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:31:20,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:31:20,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:31:20,048 INFO 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-01-31 17:31:20,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:31:20,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:31:20,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-31 17:31:20,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:31:20,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:31:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:27,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:31:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:31:35,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:31:35,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-01-31 17:31:35,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:31:35,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-01-31 17:31:35,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-01-31 17:31:35,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-01-31 17:31:35,184 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-01-31 17:32:03,532 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-31 17:32:04,194 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-31 17:32:04,862 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-31 17:32:05,534 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-31 17:32:06,170 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-31 17:32:06,785 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-31 17:32:07,355 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-31 17:32:07,917 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-31 17:32:08,448 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-31 17:32:08,983 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:32:09,532 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:32:10,044 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:32:10,541 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:32:11,062 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:32:11,519 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:32:11,943 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:32:12,361 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:32:12,760 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:32:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:16,944 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-01-31 17:32:16,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-01-31 17:32:16,945 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-01-31 17:32:16,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:16,947 INFO L225 Difference]: With dead ends: 667 [2019-01-31 17:32:16,947 INFO L226 Difference]: Without dead ends: 388 [2019-01-31 17:32:16,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 50.3s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-01-31 17:32:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-31 17:32:17,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-01-31 17:32:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-31 17:32:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-01-31 17:32:17,015 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-01-31 17:32:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:17,015 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-01-31 17:32:17,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-01-31 17:32:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-01-31 17:32:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-31 17:32:17,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:17,016 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-01-31 17:32:17,017 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:17,017 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-01-31 17:32:17,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:17,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:17,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:32:17,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:17,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:20,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:20,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:32:20,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:32:20,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:32:20,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:20,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:32:20,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:32:20,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:32:20,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:32:20,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:32:20,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:32:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:23,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:23,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:23,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:23,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-01-31 17:32:23,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:23,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-31 17:32:23,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-31 17:32:23,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-01-31 17:32:23,793 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-01-31 17:32:38,430 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-31 17:32:39,033 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-31 17:32:39,627 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-31 17:32:40,043 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-31 17:32:40,459 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-31 17:32:40,876 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-31 17:32:41,285 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-31 17:32:41,727 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-31 17:32:42,098 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-31 17:32:42,472 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-31 17:32:42,838 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:32:43,189 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:32:43,538 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:32:43,868 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:32:44,188 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:32:44,494 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:32:44,794 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:32:45,087 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:32:45,367 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:32:48,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:48,494 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-01-31 17:32:48,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-01-31 17:32:48,495 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-01-31 17:32:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:48,497 INFO L225 Difference]: With dead ends: 544 [2019-01-31 17:32:48,497 INFO L226 Difference]: Without dead ends: 402 [2019-01-31 17:32:48,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-01-31 17:32:48,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-31 17:32:48,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-01-31 17:32:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-31 17:32:48,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-01-31 17:32:48,561 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-01-31 17:32:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:48,561 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-01-31 17:32:48,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-31 17:32:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-01-31 17:32:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-31 17:32:48,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:48,563 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-31 17:32:48,563 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:48,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:48,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-01-31 17:32:48,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:48,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:48,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:32:48,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:48,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:50,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:50,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:50,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:32:50,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:32:50,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:32:50,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:32:50,309 INFO 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-01-31 17:32:50,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:32:50,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:32:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:32:50,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:32:52,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:52,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:32:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:32:54,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:32:54,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-01-31 17:32:54,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:32:54,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-31 17:32:54,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-31 17:32:54,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-01-31 17:32:54,477 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-01-31 17:32:57,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:32:57,671 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-01-31 17:32:57,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-31 17:32:57,672 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-01-31 17:32:57,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:32:57,674 INFO L225 Difference]: With dead ends: 555 [2019-01-31 17:32:57,674 INFO L226 Difference]: Without dead ends: 264 [2019-01-31 17:32:57,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-01-31 17:32:57,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-31 17:32:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-01-31 17:32:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-31 17:32:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-01-31 17:32:57,738 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-01-31 17:32:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:32:57,738 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-01-31 17:32:57,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-31 17:32:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-01-31 17:32:57,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-31 17:32:57,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:32:57,739 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-31 17:32:57,740 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:32:57,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:32:57,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-01-31 17:32:57,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:32:57,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:57,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:32:57,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:32:57,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:32:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:33:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:00,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:00,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:33:00,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:33:00,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:33:00,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:33:00,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-31 17:33:00,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:33:00,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:33:00,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-31 17:33:00,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:33:00,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:33:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:09,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:33:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:33:17,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:33:17,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-01-31 17:33:17,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:33:17,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-31 17:33:17,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-31 17:33:17,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-01-31 17:33:17,517 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-01-31 17:33:49,739 WARN L181 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-31 17:33:50,486 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-31 17:33:51,246 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-31 17:33:51,931 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-31 17:33:52,610 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-31 17:33:53,357 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-31 17:33:53,982 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-31 17:33:54,601 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-31 17:33:55,190 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-31 17:33:55,765 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-31 17:33:56,330 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-31 17:33:56,884 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:33:57,424 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:33:57,950 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:33:58,505 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:33:59,010 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:33:59,481 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:33:59,943 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:34:00,426 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:34:00,837 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:34:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:05,187 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-01-31 17:34:05,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-01-31 17:34:05,188 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-01-31 17:34:05,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:05,190 INFO L225 Difference]: With dead ends: 705 [2019-01-31 17:34:05,191 INFO L226 Difference]: Without dead ends: 410 [2019-01-31 17:34:05,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 56.2s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-01-31 17:34:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-31 17:34:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-01-31 17:34:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-31 17:34:05,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-01-31 17:34:05,267 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-01-31 17:34:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:05,267 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-01-31 17:34:05,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-31 17:34:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-01-31 17:34:05,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-31 17:34:05,268 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:05,268 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-01-31 17:34:05,268 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:05,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:05,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-01-31 17:34:05,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:05,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:34:05,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:05,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:08,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:08,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:08,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:34:08,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:34:08,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:08,528 INFO 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-01-31 17:34:08,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-31 17:34:08,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-31 17:34:08,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-31 17:34:08,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:34:08,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:34:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:12,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:34:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:12,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:34:12,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-01-31 17:34:12,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:34:12,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-31 17:34:12,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-31 17:34:12,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-01-31 17:34:12,406 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-01-31 17:34:29,234 WARN L181 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-31 17:34:29,898 WARN L181 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-31 17:34:30,551 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-31 17:34:31,010 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-01-31 17:34:31,467 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-31 17:34:31,922 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-31 17:34:32,349 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-31 17:34:32,771 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-31 17:34:33,189 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-31 17:34:33,587 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-31 17:34:34,022 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-31 17:34:34,431 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-31 17:34:34,802 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-31 17:34:35,166 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-31 17:34:35,518 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-31 17:34:35,868 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-31 17:34:36,204 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-31 17:34:36,532 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-31 17:34:36,834 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-31 17:34:37,128 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-31 17:34:37,424 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-31 17:34:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:40,660 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-01-31 17:34:40,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-31 17:34:40,661 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-01-31 17:34:40,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:40,663 INFO L225 Difference]: With dead ends: 574 [2019-01-31 17:34:40,663 INFO L226 Difference]: Without dead ends: 424 [2019-01-31 17:34:40,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-01-31 17:34:40,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-31 17:34:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-01-31 17:34:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-31 17:34:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-01-31 17:34:40,750 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-01-31 17:34:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:40,750 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-01-31 17:34:40,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-31 17:34:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-01-31 17:34:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-31 17:34:40,752 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:40,752 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-31 17:34:40,752 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:40,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:40,753 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-01-31 17:34:40,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:40,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:40,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:34:40,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:40,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:42,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:42,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:42,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:42,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:34:42,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:34:42,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:42,718 INFO 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-01-31 17:34:42,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:42,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-31 17:34:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:42,783 INFO L273 TraceCheckSpWp]: Computing forward predicates...