java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:01:01,471 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:01:01,473 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:01:01,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:01:01,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:01:01,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:01:01,492 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:01:01,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:01:01,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:01:01,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:01:01,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:01:01,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:01:01,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:01:01,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:01:01,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:01:01,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:01:01,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:01:01,504 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:01:01,506 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:01:01,507 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:01:01,509 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:01:01,510 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:01:01,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:01:01,513 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:01:01,513 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:01:01,514 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:01:01,515 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:01:01,516 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:01:01,517 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:01:01,518 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:01:01,518 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:01:01,519 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:01:01,519 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:01:01,520 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:01:01,521 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:01:01,522 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:01:01,522 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 11:01:01,535 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:01:01,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:01:01,536 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:01:01,536 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:01:01,536 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:01:01,537 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:01:01,537 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:01:01,537 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:01:01,537 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:01:01,537 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:01:01,538 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:01:01,538 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:01:01,538 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:01:01,538 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:01:01,539 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:01:01,539 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:01:01,539 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:01:01,540 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:01:01,540 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:01:01,540 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:01:01,540 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:01:01,540 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:01:01,540 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:01:01,541 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:01:01,541 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:01:01,541 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:01:01,541 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:01:01,541 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:01:01,542 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:01:01,542 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:01:01,542 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:01:01,542 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:01:01,543 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:01:01,543 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:01:01,543 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:01:01,543 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:01:01,543 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:01:01,543 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:01:01,544 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:01:01,544 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:01:01,576 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:01:01,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:01:01,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:01:01,593 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:01:01,593 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:01:01,594 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-11 11:01:01,594 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-01-11 11:01:01,631 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:01:01,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:01:01,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:01:01,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:01:01,633 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:01:01,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/1) ... [2019-01-11 11:01:01,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/1) ... [2019-01-11 11:01:01,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:01:01,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:01:01,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:01:01,667 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:01:01,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/1) ... [2019-01-11 11:01:01,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/1) ... [2019-01-11 11:01:01,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/1) ... [2019-01-11 11:01:01,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/1) ... [2019-01-11 11:01:01,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/1) ... [2019-01-11 11:01:01,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/1) ... [2019-01-11 11:01:01,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/1) ... [2019-01-11 11:01:01,689 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:01:01,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:01:01,690 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:01:01,690 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:01:01,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (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:8192 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:01:01,764 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-01-11 11:01:01,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:01:01,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:01:02,071 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:01:02,071 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-01-11 11:01:02,072 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:01:02 BoogieIcfgContainer [2019-01-11 11:01:02,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:01:02,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:01:02,074 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:01:02,077 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:01:02,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:01" (1/2) ... [2019-01-11 11:01:02,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a48ce88 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:01:02, skipping insertion in model container [2019-01-11 11:01:02,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:01:02" (2/2) ... [2019-01-11 11:01:02,080 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-01-11 11:01:02,090 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:01:02,098 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 11:01:02,116 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 11:01:02,147 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:01:02,148 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:01:02,148 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:01:02,148 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:01:02,148 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:01:02,149 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:01:02,149 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:01:02,149 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:01:02,161 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-01-11 11:01:02,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:01:02,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:02,169 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:01:02,171 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:02,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:02,178 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-01-11 11:01:02,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:02,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:02,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:02,396 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-11 11:01:02,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:02,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:01:02,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:02,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:01:02,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:01:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:01:02,435 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-01-11 11:01:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:02,576 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-01-11 11:01:02,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:01:02,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-11 11:01:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:02,590 INFO L225 Difference]: With dead ends: 26 [2019-01-11 11:01:02,590 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 11:01:02,593 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-11 11:01:02,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 11:01:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-01-11 11:01:02,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 11:01:02,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-01-11 11:01:02,625 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-01-11 11:01:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:02,625 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-11 11:01:02,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:01:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-01-11 11:01:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:01:02,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:02,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:01:02,627 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:02,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:02,627 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-01-11 11:01:02,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:02,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:02,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:02,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:02,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:02,939 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2019-01-11 11:01:02,943 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-11 11:01:02,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:02,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-11 11:01:02,944 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:02,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:01:02,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:01:02,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:01:02,947 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-01-11 11:01:03,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:03,063 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-01-11 11:01:03,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:01:03,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-01-11 11:01:03,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:03,065 INFO L225 Difference]: With dead ends: 25 [2019-01-11 11:01:03,065 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 11:01:03,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:01:03,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 11:01:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-01-11 11:01:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 11:01:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-01-11 11:01:03,071 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-01-11 11:01:03,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:03,072 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-01-11 11:01:03,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:01:03,072 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-01-11 11:01:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:01:03,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:03,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:01:03,073 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:03,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-01-11 11:01:03,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:03,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:03,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:03,142 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-11 11:01:03,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:03,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:01:03,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:03,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:01:03,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:01:03,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:01:03,144 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-01-11 11:01:03,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:03,211 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-01-11 11:01:03,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:01:03,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-11 11:01:03,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:03,214 INFO L225 Difference]: With dead ends: 24 [2019-01-11 11:01:03,214 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 11:01:03,215 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-11 11:01:03,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 11:01:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-11 11:01:03,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:01:03,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-11 11:01:03,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-01-11 11:01:03,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:03,219 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-11 11:01:03,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:01:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-11 11:01:03,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:01:03,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:03,220 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:01:03,220 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:03,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:03,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-01-11 11:01:03,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:03,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:03,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:03,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:03,546 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-11 11:01:03,589 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-11 11:01:03,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:03,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:03,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-11 11:01:03,592 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-01-11 11:01:03,630 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:01:03,630 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:01:03,756 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:01:03,757 INFO L272 AbstractInterpreter]: Visited 9 different actions 29 times. Merged at 8 different actions 18 times. Widened at 1 different actions 1 times. Performed 110 root evaluator evaluations with a maximum evaluation depth of 3. Performed 110 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-11 11:01:03,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:03,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:01:03,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:03,765 INFO 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-11 11:01:03,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:03,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:03,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:03,881 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-11 11:01:03,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:03,968 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-11 11:01:03,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:03,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-01-11 11:01:03,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:03,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 11:01:03,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 11:01:03,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-11 11:01:03,989 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-01-11 11:01:04,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:04,207 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-01-11 11:01:04,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:01:04,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-01-11 11:01:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:04,211 INFO L225 Difference]: With dead ends: 26 [2019-01-11 11:01:04,211 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 11:01:04,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-11 11:01:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 11:01:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-01-11 11:01:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 11:01:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-01-11 11:01:04,216 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-01-11 11:01:04,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:04,216 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-01-11 11:01:04,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 11:01:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-01-11 11:01:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-11 11:01:04,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:04,217 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:01:04,218 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:04,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:04,218 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-01-11 11:01:04,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:04,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:04,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:04,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:04,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:04,295 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-11 11:01:04,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:04,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:04,297 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-01-11 11:01:04,298 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-01-11 11:01:04,299 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:01:04,299 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:01:04,336 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:01:04,336 INFO L272 AbstractInterpreter]: Visited 12 different actions 41 times. Merged at 11 different actions 22 times. Widened at 1 different actions 1 times. Performed 147 root evaluator evaluations with a maximum evaluation depth of 4. Performed 147 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 7 different actions. Largest state had 0 variables. [2019-01-11 11:01:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:04,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:01:04,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:04,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 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-11 11:01:04,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:04,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:04,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:04,455 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-11 11:01:04,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:04,489 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-11 11:01:04,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:04,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-01-11 11:01:04,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:04,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:01:04,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:01:04,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-11 11:01:04,512 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-01-11 11:01:04,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:04,866 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-01-11 11:01:04,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:01:04,867 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-01-11 11:01:04,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:04,868 INFO L225 Difference]: With dead ends: 31 [2019-01-11 11:01:04,868 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 11:01:04,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 11:01:04,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 11:01:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-01-11 11:01:04,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:01:04,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-01-11 11:01:04,873 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-01-11 11:01:04,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:04,873 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-01-11 11:01:04,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:01:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-01-11 11:01:04,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 11:01:04,874 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:04,874 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:01:04,874 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:04,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-01-11 11:01:04,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:04,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:04,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:05,192 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-11 11:01:05,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:05,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:05,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:05,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:05,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:05,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:01:05,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:05,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:05,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:01:05,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:05,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:05,311 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-11 11:01:05,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:05,353 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-11 11:01:05,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:05,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-01-11 11:01:05,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:05,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:01:05,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:01:05,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:01:05,384 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-01-11 11:01:05,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:05,662 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-11 11:01:05,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:01:05,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-01-11 11:01:05,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:05,664 INFO L225 Difference]: With dead ends: 35 [2019-01-11 11:01:05,665 INFO L226 Difference]: Without dead ends: 28 [2019-01-11 11:01:05,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-01-11 11:01:05,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-11 11:01:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-01-11 11:01:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 11:01:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-01-11 11:01:05,671 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-01-11 11:01:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:05,671 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-01-11 11:01:05,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:01:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-01-11 11:01:05,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 11:01:05,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:05,672 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-11 11:01:05,673 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:05,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:05,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-01-11 11:01:05,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:05,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:05,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:05,799 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-11 11:01:05,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:05,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:05,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:05,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:05,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:05,800 INFO 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-11 11:01:05,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:05,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:05,817 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:05,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:05,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:05,873 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-11 11:01:05,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:05,899 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-11 11:01:05,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:05,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-01-11 11:01:05,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:05,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 11:01:05,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 11:01:05,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:01:05,919 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-01-11 11:01:06,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:06,050 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-01-11 11:01:06,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:01:06,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-11 11:01:06,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:06,052 INFO L225 Difference]: With dead ends: 45 [2019-01-11 11:01:06,052 INFO L226 Difference]: Without dead ends: 26 [2019-01-11 11:01:06,053 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-11 11:01:06,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-11 11:01:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-01-11 11:01:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-11 11:01:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-01-11 11:01:06,058 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-01-11 11:01:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:06,058 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-01-11 11:01:06,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 11:01:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-01-11 11:01:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-11 11:01:06,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:06,059 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-01-11 11:01:06,059 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:06,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-01-11 11:01:06,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:06,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:06,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:06,345 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-11 11:01:06,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:06,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:06,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:06,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:06,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:06,346 INFO 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-11 11:01:06,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:06,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:06,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:06,444 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-11 11:01:06,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:06,475 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-11 11:01:06,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:06,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-01-11 11:01:06,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:06,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:01:06,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:01:06,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:01:06,495 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-01-11 11:01:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:06,971 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-01-11 11:01:06,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 11:01:06,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-01-11 11:01:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:06,972 INFO L225 Difference]: With dead ends: 49 [2019-01-11 11:01:06,973 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 11:01:06,973 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-11 11:01:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 11:01:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-11 11:01:06,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-11 11:01:06,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-11 11:01:06,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-01-11 11:01:06,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:06,979 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-11 11:01:06,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:01:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-11 11:01:06,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-11 11:01:06,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:06,980 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-11 11:01:06,981 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:06,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-01-11 11:01:06,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,086 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-11 11:01:07,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:07,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:07,087 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:07,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:07,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:07,087 INFO 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-11 11:01:07,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:07,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:07,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 11:01:07,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:07,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:07,270 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-11 11:01:07,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:07,349 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-11 11:01:07,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:07,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-01-11 11:01:07,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:07,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:01:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:01:07,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:01:07,377 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-01-11 11:01:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:08,205 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-01-11 11:01:08,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:01:08,206 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-01-11 11:01:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:08,206 INFO L225 Difference]: With dead ends: 60 [2019-01-11 11:01:08,206 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 11:01:08,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-01-11 11:01:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 11:01:08,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-01-11 11:01:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 11:01:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-11 11:01:08,213 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-01-11 11:01:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:08,213 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-11 11:01:08,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:01:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-11 11:01:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 11:01:08,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:08,215 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-01-11 11:01:08,215 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:08,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:08,215 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-01-11 11:01:08,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:08,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:08,441 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-11 11:01:08,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:08,442 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:08,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:08,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,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 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-11 11:01:08,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:08,451 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:08,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:08,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:08,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:08,598 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-11 11:01:08,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:08,637 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-11 11:01:08,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:08,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-01-11 11:01:08,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:08,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 11:01:08,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 11:01:08,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:01:08,657 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-01-11 11:01:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:09,156 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-01-11 11:01:09,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 11:01:09,159 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-01-11 11:01:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:09,160 INFO L225 Difference]: With dead ends: 64 [2019-01-11 11:01:09,160 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 11:01:09,161 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-11 11:01:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 11:01:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-11 11:01:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 11:01:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-01-11 11:01:09,167 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-01-11 11:01:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:09,167 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-01-11 11:01:09,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 11:01:09,168 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-01-11 11:01:09,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 11:01:09,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:09,169 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-11 11:01:09,169 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:09,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:09,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-01-11 11:01:09,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:09,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:09,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:09,331 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-11 11:01:09,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:09,332 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:09,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:09,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,332 INFO 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-11 11:01:09,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:09,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:09,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:09,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:09,878 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-11 11:01:09,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:09,922 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-11 11:01:09,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:09,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-01-11 11:01:09,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:09,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 11:01:09,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 11:01:09,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:01:09,944 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-01-11 11:01:10,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:10,199 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-01-11 11:01:10,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:01:10,199 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-01-11 11:01:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:10,200 INFO L225 Difference]: With dead ends: 75 [2019-01-11 11:01:10,201 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 11:01:10,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-01-11 11:01:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 11:01:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-01-11 11:01:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-11 11:01:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-01-11 11:01:10,208 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-01-11 11:01:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:10,208 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-01-11 11:01:10,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 11:01:10,209 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-01-11 11:01:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-11 11:01:10,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:10,210 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-01-11 11:01:10,210 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:10,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:10,210 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-01-11 11:01:10,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:10,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:10,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:10,457 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-11 11:01:10,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:10,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:10,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:10,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,457 INFO 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-11 11:01:10,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:10,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:10,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-11 11:01:10,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:10,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:10,943 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-11 11:01:10,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:11,750 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-11 11:01:11,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:11,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-01-11 11:01:11,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:11,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-11 11:01:11,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-11 11:01:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:01:11,771 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-01-11 11:01:13,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:13,900 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-01-11 11:01:13,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 11:01:13,901 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-01-11 11:01:13,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:13,901 INFO L225 Difference]: With dead ends: 97 [2019-01-11 11:01:13,902 INFO L226 Difference]: Without dead ends: 58 [2019-01-11 11:01:13,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 11:01:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-11 11:01:13,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-01-11 11:01:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 11:01:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-11 11:01:13,912 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-01-11 11:01:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:13,912 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-11 11:01:13,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-11 11:01:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-11 11:01:13,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 11:01:13,914 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:13,914 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-01-11 11:01:13,914 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:13,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:13,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-01-11 11:01:13,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:13,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:13,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:14,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-11 11:01:14,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:14,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:14,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:14,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:14,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:14,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-11 11:01:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:14,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:14,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:14,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:14,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:14,651 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-11 11:01:14,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:14,683 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-11 11:01:14,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:14,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-01-11 11:01:14,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:14,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 11:01:14,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 11:01:14,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:01:14,703 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-01-11 11:01:15,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:15,967 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-01-11 11:01:15,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 11:01:15,968 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-11 11:01:15,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:15,969 INFO L225 Difference]: With dead ends: 94 [2019-01-11 11:01:15,969 INFO L226 Difference]: Without dead ends: 72 [2019-01-11 11:01:15,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:01:15,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-11 11:01:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-01-11 11:01:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 11:01:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-11 11:01:15,978 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-01-11 11:01:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:15,979 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-11 11:01:15,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 11:01:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-11 11:01:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 11:01:15,980 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:15,980 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-11 11:01:15,980 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:15,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:15,981 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-01-11 11:01:15,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:15,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:15,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:16,205 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-11 11:01:16,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:16,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:16,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:16,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:01:16,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:16,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:16,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:16,362 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-11 11:01:16,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:16,467 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-11 11:01:16,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:16,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-01-11 11:01:16,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:16,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 11:01:16,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 11:01:16,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:01:16,488 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-01-11 11:01:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:16,853 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-01-11 11:01:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 11:01:16,854 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-01-11 11:01:16,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:16,855 INFO L225 Difference]: With dead ends: 105 [2019-01-11 11:01:16,855 INFO L226 Difference]: Without dead ends: 54 [2019-01-11 11:01:16,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-01-11 11:01:16,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-11 11:01:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-01-11 11:01:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 11:01:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-01-11 11:01:16,866 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-01-11 11:01:16,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:16,866 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-01-11 11:01:16,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 11:01:16,866 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-01-11 11:01:16,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 11:01:16,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:16,867 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-01-11 11:01:16,868 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:16,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:16,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-01-11 11:01:16,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:16,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:16,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:16,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:16,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:17,229 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-11 11:01:17,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:17,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:17,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:17,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:17,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:17,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:01:17,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:17,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:17,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-11 11:01:17,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:17,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:17,793 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-11 11:01:17,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:17,830 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-11 11:01:17,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:17,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-01-11 11:01:17,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:17,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 11:01:17,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 11:01:17,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:01:17,852 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-01-11 11:01:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:19,139 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-01-11 11:01:19,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 11:01:19,139 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-01-11 11:01:19,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:19,140 INFO L225 Difference]: With dead ends: 109 [2019-01-11 11:01:19,140 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 11:01:19,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 11:01:19,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 11:01:19,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-01-11 11:01:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-11 11:01:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-01-11 11:01:19,151 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-01-11 11:01:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:19,151 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-01-11 11:01:19,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 11:01:19,151 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-01-11 11:01:19,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-11 11:01:19,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:19,152 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-11 11:01:19,153 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:19,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:19,153 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-01-11 11:01:19,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:19,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:19,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:19,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:19,418 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-11 11:01:19,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:19,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:19,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:19,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:19,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:19,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:01:19,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:19,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:19,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:19,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:19,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:19,597 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-11 11:01:19,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:19,752 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-11 11:01:19,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:19,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-01-11 11:01:19,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:19,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 11:01:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 11:01:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:01:19,774 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-01-11 11:01:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:20,127 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-01-11 11:01:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 11:01:20,127 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-11 11:01:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:20,128 INFO L225 Difference]: With dead ends: 120 [2019-01-11 11:01:20,128 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 11:01:20,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 11:01:20,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 11:01:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-01-11 11:01:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 11:01:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-01-11 11:01:20,137 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-01-11 11:01:20,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:20,138 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-01-11 11:01:20,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 11:01:20,138 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-01-11 11:01:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-11 11:01:20,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:20,139 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-01-11 11:01:20,139 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:20,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-01-11 11:01:20,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:20,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:20,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:20,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:20,525 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-11 11:01:20,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:20,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:20,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:20,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:20,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:20,525 INFO 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-11 11:01:20,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:20,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:20,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:20,772 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-11 11:01:20,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:20,850 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-11 11:01:20,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:20,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-01-11 11:01:20,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:20,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 11:01:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 11:01:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:01:20,870 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-01-11 11:01:22,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:22,326 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-01-11 11:01:22,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 11:01:22,327 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-01-11 11:01:22,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:22,328 INFO L225 Difference]: With dead ends: 124 [2019-01-11 11:01:22,329 INFO L226 Difference]: Without dead ends: 94 [2019-01-11 11:01:22,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-01-11 11:01:22,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-11 11:01:22,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-01-11 11:01:22,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 11:01:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-01-11 11:01:22,341 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-01-11 11:01:22,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:22,341 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-01-11 11:01:22,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 11:01:22,342 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-01-11 11:01:22,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-11 11:01:22,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:22,343 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-11 11:01:22,343 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:22,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-01-11 11:01:22,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:22,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:22,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:22,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:22,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:22,828 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-11 11:01:22,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:22,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:22,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:22,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:22,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:22,828 INFO 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-11 11:01:22,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:22,836 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:22,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 11:01:22,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:22,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:23,105 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-11 11:01:23,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:23,260 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-11 11:01:23,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:23,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-01-11 11:01:23,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:23,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 11:01:23,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 11:01:23,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:01:23,279 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-01-11 11:01:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:23,842 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-01-11 11:01:23,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 11:01:23,843 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-01-11 11:01:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:23,844 INFO L225 Difference]: With dead ends: 135 [2019-01-11 11:01:23,844 INFO L226 Difference]: Without dead ends: 68 [2019-01-11 11:01:23,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:23,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-11 11:01:23,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-01-11 11:01:23,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-11 11:01:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-01-11 11:01:23,860 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-01-11 11:01:23,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:23,860 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-01-11 11:01:23,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 11:01:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-01-11 11:01:23,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-11 11:01:23,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:23,861 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-01-11 11:01:23,861 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:23,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:23,863 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-01-11 11:01:23,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:23,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:23,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:23,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:24,298 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-11 11:01:24,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:24,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:24,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:24,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,298 INFO 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-11 11:01:24,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:24,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:24,319 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:24,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:24,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:24,620 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-11 11:01:24,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:24,666 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-11 11:01:24,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:24,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-01-11 11:01:24,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:24,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 11:01:24,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 11:01:24,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:01:24,685 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-01-11 11:01:26,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:26,462 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-01-11 11:01:26,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 11:01:26,463 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-01-11 11:01:26,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:26,464 INFO L225 Difference]: With dead ends: 139 [2019-01-11 11:01:26,464 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 11:01:26,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:01:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 11:01:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-01-11 11:01:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-11 11:01:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-01-11 11:01:26,475 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-01-11 11:01:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:26,476 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-01-11 11:01:26,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 11:01:26,476 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-01-11 11:01:26,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-11 11:01:26,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:26,477 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-11 11:01:26,477 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-01-11 11:01:26,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:26,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:26,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:26,479 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:26,718 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-11 11:01:26,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:26,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:26,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:26,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:26,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:26,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:01:26,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:26,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:26,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:27,424 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-11 11:01:27,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:27,561 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-11 11:01:27,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:27,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-01-11 11:01:27,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:27,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 11:01:27,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 11:01:27,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:01:27,581 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-01-11 11:01:28,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:28,146 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-01-11 11:01:28,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 11:01:28,147 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-01-11 11:01:28,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:28,148 INFO L225 Difference]: With dead ends: 150 [2019-01-11 11:01:28,148 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 11:01:28,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 11:01:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 11:01:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-01-11 11:01:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 11:01:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-01-11 11:01:28,157 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-01-11 11:01:28,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:28,157 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-01-11 11:01:28,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 11:01:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-01-11 11:01:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 11:01:28,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:28,158 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-01-11 11:01:28,158 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:28,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:28,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-01-11 11:01:28,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:28,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:28,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:28,160 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:28,853 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-11 11:01:28,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:28,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:28,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:28,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:28,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:28,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:01:28,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:28,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:28,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-11 11:01:28,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:28,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:29,784 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-11 11:01:29,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:30,485 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-11 11:01:30,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:30,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-01-11 11:01:30,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:30,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 11:01:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 11:01:30,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:01:30,506 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-01-11 11:01:33,181 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-11 11:01:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:35,139 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-01-11 11:01:35,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 11:01:35,139 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-01-11 11:01:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:35,141 INFO L225 Difference]: With dead ends: 192 [2019-01-11 11:01:35,141 INFO L226 Difference]: Without dead ends: 113 [2019-01-11 11:01:35,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 11:01:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-11 11:01:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-01-11 11:01:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-11 11:01:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-01-11 11:01:35,154 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-01-11 11:01:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:35,154 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-01-11 11:01:35,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 11:01:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-01-11 11:01:35,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-11 11:01:35,155 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:35,155 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-01-11 11:01:35,155 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:35,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:35,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-01-11 11:01:35,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:35,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:35,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:35,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:35,683 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-11 11:01:35,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:35,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:35,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:35,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:35,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:35,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:01:35,698 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:35,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:35,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:35,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:35,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:36,276 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-11 11:01:36,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:36,330 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-11 11:01:36,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:36,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-01-11 11:01:36,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:36,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 11:01:36,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 11:01:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:36,351 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-01-11 11:01:38,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:38,475 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-01-11 11:01:38,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 11:01:38,478 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-01-11 11:01:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:38,478 INFO L225 Difference]: With dead ends: 169 [2019-01-11 11:01:38,479 INFO L226 Difference]: Without dead ends: 127 [2019-01-11 11:01:38,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-01-11 11:01:38,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-11 11:01:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-01-11 11:01:38,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-11 11:01:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-01-11 11:01:38,489 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-01-11 11:01:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:38,489 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-01-11 11:01:38,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 11:01:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-01-11 11:01:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-11 11:01:38,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:38,490 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-11 11:01:38,490 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:38,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:38,491 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-01-11 11:01:38,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:38,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:38,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:38,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:38,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:39,430 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-11 11:01:39,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:39,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:39,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:39,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:39,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:39,431 INFO 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-11 11:01:39,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:39,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:39,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:39,769 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-11 11:01:39,769 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:39,947 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-11 11:01:39,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:39,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-01-11 11:01:39,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:39,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 11:01:39,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 11:01:39,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:39,967 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-01-11 11:01:40,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:40,492 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-01-11 11:01:40,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 11:01:40,492 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-01-11 11:01:40,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:40,494 INFO L225 Difference]: With dead ends: 180 [2019-01-11 11:01:40,494 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 11:01:40,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:01:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 11:01:40,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-01-11 11:01:40,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-11 11:01:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-01-11 11:01:40,504 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-01-11 11:01:40,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:40,505 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-01-11 11:01:40,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 11:01:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-01-11 11:01:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 11:01:40,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:40,506 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-01-11 11:01:40,506 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:40,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:40,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-01-11 11:01:40,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:40,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:40,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:40,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:40,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:41,119 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-11 11:01:41,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:41,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:41,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:41,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:41,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:41,121 INFO 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-11 11:01:41,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:41,131 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:41,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-11 11:01:41,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:41,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:42,236 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-11 11:01:42,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:43,406 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-11 11:01:43,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:43,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-01-11 11:01:43,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:43,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-11 11:01:43,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-11 11:01:43,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-01-11 11:01:43,426 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-01-11 11:01:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:49,428 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-01-11 11:01:49,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 11:01:49,428 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-01-11 11:01:49,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:49,430 INFO L225 Difference]: With dead ends: 230 [2019-01-11 11:01:49,430 INFO L226 Difference]: Without dead ends: 135 [2019-01-11 11:01:49,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-01-11 11:01:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-11 11:01:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-01-11 11:01:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-11 11:01:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-01-11 11:01:49,448 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-01-11 11:01:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:49,449 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-01-11 11:01:49,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-11 11:01:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-01-11 11:01:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-11 11:01:49,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:49,449 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-01-11 11:01:49,450 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-01-11 11:01:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:49,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:49,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:50,051 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-11 11:01:50,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:50,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:50,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:50,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:50,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:50,052 INFO 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-11 11:01:50,061 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:50,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:50,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:50,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:50,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:50,624 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-11 11:01:50,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:50,698 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-11 11:01:50,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:50,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-01-11 11:01:50,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:50,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 11:01:50,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 11:01:50,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:01:50,719 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-01-11 11:01:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:53,913 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-01-11 11:01:53,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 11:01:53,913 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-01-11 11:01:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:53,914 INFO L225 Difference]: With dead ends: 199 [2019-01-11 11:01:53,915 INFO L226 Difference]: Without dead ends: 149 [2019-01-11 11:01:53,916 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-11 11:01:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-11 11:01:53,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-01-11 11:01:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-11 11:01:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-01-11 11:01:53,929 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-01-11 11:01:53,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:53,930 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-01-11 11:01:53,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 11:01:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-01-11 11:01:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-11 11:01:53,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:53,930 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-11 11:01:53,931 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:53,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-01-11 11:01:53,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:53,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:53,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:53,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:53,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:54,323 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-11 11:01:54,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:54,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:54,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:54,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:54,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:54,324 INFO 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-11 11:01:54,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:54,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:54,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:54,696 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-11 11:01:54,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:55,461 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-11 11:01:55,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:55,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-01-11 11:01:55,480 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:55,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 11:01:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 11:01:55,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:01:55,481 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-01-11 11:01:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:56,139 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-01-11 11:01:56,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 11:01:56,139 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-01-11 11:01:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:56,140 INFO L225 Difference]: With dead ends: 210 [2019-01-11 11:01:56,140 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 11:01:56,141 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-11 11:01:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 11:01:56,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-01-11 11:01:56,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 11:01:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-01-11 11:01:56,156 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-01-11 11:01:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:56,156 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-01-11 11:01:56,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 11:01:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-01-11 11:01:56,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 11:01:56,157 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:56,157 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-01-11 11:01:56,157 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:01:56,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:56,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-01-11 11:01:56,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:56,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:56,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:56,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:56,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:56,795 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-11 11:01:56,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:56,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:56,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:56,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:56,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:56,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:01:56,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:56,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:56,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-11 11:01:56,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:56,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:57,529 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-11 11:01:57,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:57,611 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-11 11:01:57,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:57,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-01-11 11:01:57,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:57,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 11:01:57,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 11:01:57,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:01:57,640 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-01-11 11:02:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:01,279 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-01-11 11:02:01,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 11:02:01,279 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-01-11 11:02:01,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:01,281 INFO L225 Difference]: With dead ends: 214 [2019-01-11 11:02:01,281 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 11:02:01,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-01-11 11:02:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 11:02:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-01-11 11:02:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 11:02:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-01-11 11:02:01,298 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-01-11 11:02:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:01,298 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-01-11 11:02:01,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 11:02:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-01-11 11:02:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 11:02:01,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:01,299 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-11 11:02:01,299 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:01,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:01,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-01-11 11:02:01,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:01,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:01,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:01,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:01,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:01,749 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-11 11:02:01,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:01,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:01,750 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:01,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:01,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:01,750 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:02:01,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:01,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:01,775 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:01,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:01,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:02,170 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-11 11:02:02,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:02,449 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-11 11:02:02,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:02,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-01-11 11:02:02,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:02,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 11:02:02,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 11:02:02,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:02:02,468 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-01-11 11:02:03,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:03,096 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-01-11 11:02:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 11:02:03,097 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-01-11 11:02:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:03,098 INFO L225 Difference]: With dead ends: 225 [2019-01-11 11:02:03,098 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 11:02:03,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:02:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 11:02:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-01-11 11:02:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-11 11:02:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-11 11:02:03,115 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-01-11 11:02:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:03,115 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-11 11:02:03,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 11:02:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-11 11:02:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-11 11:02:03,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:03,116 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-01-11 11:02:03,116 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:03,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-01-11 11:02:03,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:03,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:03,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:03,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:03,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:04,181 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-11 11:02:04,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:04,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:04,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:04,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:04,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:04,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 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-11 11:02:04,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:04,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:04,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:04,858 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-11 11:02:04,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:04,934 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-11 11:02:04,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:04,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-01-11 11:02:04,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:04,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 11:02:04,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 11:02:04,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:02:04,954 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-01-11 11:02:09,629 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-11 11:02:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:09,944 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-01-11 11:02:09,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 11:02:09,944 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-01-11 11:02:09,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:09,945 INFO L225 Difference]: With dead ends: 229 [2019-01-11 11:02:09,946 INFO L226 Difference]: Without dead ends: 171 [2019-01-11 11:02:09,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:02:09,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-11 11:02:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-01-11 11:02:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-11 11:02:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-01-11 11:02:09,963 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-01-11 11:02:09,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:09,963 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-01-11 11:02:09,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 11:02:09,963 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-01-11 11:02:09,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-11 11:02:09,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:09,964 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-11 11:02:09,964 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:09,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:09,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-01-11 11:02:09,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:09,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:09,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:09,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:09,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:10,431 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-11 11:02:10,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:10,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:10,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:10,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:10,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:10,432 INFO 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-11 11:02:10,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:10,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:10,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-11 11:02:10,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:10,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:10,938 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-11 11:02:10,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:11,272 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-11 11:02:11,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:11,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-01-11 11:02:11,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:11,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 11:02:11,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 11:02:11,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:02:11,292 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-01-11 11:02:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:11,887 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-01-11 11:02:11,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 11:02:11,887 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-01-11 11:02:11,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:11,888 INFO L225 Difference]: With dead ends: 240 [2019-01-11 11:02:11,888 INFO L226 Difference]: Without dead ends: 117 [2019-01-11 11:02:11,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 11:02:11,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-11 11:02:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-01-11 11:02:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-11 11:02:11,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-01-11 11:02:11,907 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-01-11 11:02:11,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:11,907 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-01-11 11:02:11,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 11:02:11,908 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-01-11 11:02:11,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-11 11:02:11,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:11,908 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-01-11 11:02:11,909 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:11,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:11,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-01-11 11:02:11,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:11,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:11,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:11,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:11,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:13,055 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-11 11:02:13,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:13,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:13,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:13,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:13,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:13,056 INFO 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-11 11:02:13,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:13,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:13,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:13,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:13,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:14,230 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-11 11:02:14,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:14,314 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-11 11:02:14,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-01-11 11:02:14,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:14,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 11:02:14,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 11:02:14,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:02:14,334 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-01-11 11:02:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:19,545 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-01-11 11:02:19,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 11:02:19,548 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-01-11 11:02:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:19,549 INFO L225 Difference]: With dead ends: 244 [2019-01-11 11:02:19,549 INFO L226 Difference]: Without dead ends: 182 [2019-01-11 11:02:19,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2019-01-11 11:02:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-01-11 11:02:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-01-11 11:02:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-11 11:02:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-01-11 11:02:19,572 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-01-11 11:02:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:19,572 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-01-11 11:02:19,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 11:02:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-01-11 11:02:19,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-11 11:02:19,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:19,573 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-11 11:02:19,574 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:19,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:19,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-01-11 11:02:19,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:19,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:19,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:19,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:20,267 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-11 11:02:20,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:20,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:20,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:20,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:20,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:20,267 INFO 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-11 11:02:20,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:20,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:20,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:20,810 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-11 11:02:20,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:21,152 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-11 11:02:21,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:21,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-01-11 11:02:21,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:21,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 11:02:21,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 11:02:21,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:02:21,172 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-01-11 11:02:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:22,078 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-01-11 11:02:22,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 11:02:22,078 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-01-11 11:02:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:22,079 INFO L225 Difference]: With dead ends: 255 [2019-01-11 11:02:22,079 INFO L226 Difference]: Without dead ends: 124 [2019-01-11 11:02:22,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 11:02:22,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-11 11:02:22,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-01-11 11:02:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-11 11:02:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-01-11 11:02:22,097 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-01-11 11:02:22,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:22,097 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-01-11 11:02:22,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 11:02:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-01-11 11:02:22,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 11:02:22,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:22,098 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-01-11 11:02:22,098 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:22,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:22,098 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-01-11 11:02:22,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:22,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:22,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:22,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:22,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:23,050 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-11 11:02:23,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:23,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:23,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:23,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:23,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:23,051 INFO 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-11 11:02:23,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:23,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:23,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-11 11:02:23,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:23,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:25,263 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-11 11:02:25,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:27,008 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-11 11:02:27,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:27,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-01-11 11:02:27,027 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:27,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-11 11:02:27,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-11 11:02:27,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:02:27,028 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-01-11 11:02:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:37,388 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-01-11 11:02:37,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-01-11 11:02:37,388 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-01-11 11:02:37,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:37,389 INFO L225 Difference]: With dead ends: 325 [2019-01-11 11:02:37,389 INFO L226 Difference]: Without dead ends: 190 [2019-01-11 11:02:37,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-01-11 11:02:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-11 11:02:37,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-01-11 11:02:37,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-11 11:02:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-01-11 11:02:37,408 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-01-11 11:02:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:37,408 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-01-11 11:02:37,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-11 11:02:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-01-11 11:02:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-11 11:02:37,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:37,409 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-01-11 11:02:37,409 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:37,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:37,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-01-11 11:02:37,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:37,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:37,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:37,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:37,411 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:39,209 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-11 11:02:39,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:39,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:39,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:39,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:39,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:39,210 INFO 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-11 11:02:39,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:39,219 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:39,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:39,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:39,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:40,441 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-11 11:02:40,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:40,570 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-11 11:02:40,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:40,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-01-11 11:02:40,588 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:40,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-11 11:02:40,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-11 11:02:40,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:02:40,589 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-01-11 11:02:44,606 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-01-11 11:02:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:46,278 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-01-11 11:02:46,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 11:02:46,278 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-01-11 11:02:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:46,280 INFO L225 Difference]: With dead ends: 274 [2019-01-11 11:02:46,280 INFO L226 Difference]: Without dead ends: 204 [2019-01-11 11:02:46,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:02:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-11 11:02:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-01-11 11:02:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-11 11:02:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-01-11 11:02:46,304 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-01-11 11:02:46,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:46,304 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-01-11 11:02:46,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-11 11:02:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-01-11 11:02:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-11 11:02:46,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:46,305 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-11 11:02:46,305 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:46,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:46,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-01-11 11:02:46,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:46,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:46,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:46,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:46,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:47,003 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-11 11:02:47,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:47,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:47,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:47,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:47,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:47,004 INFO 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-11 11:02:47,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:47,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:47,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:47,673 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-11 11:02:47,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:48,112 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-11 11:02:48,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:48,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-01-11 11:02:48,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:48,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-11 11:02:48,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-11 11:02:48,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:02:48,131 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-01-11 11:02:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:49,028 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-01-11 11:02:49,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 11:02:49,028 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-01-11 11:02:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:49,030 INFO L225 Difference]: With dead ends: 285 [2019-01-11 11:02:49,030 INFO L226 Difference]: Without dead ends: 138 [2019-01-11 11:02:49,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 11:02:49,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-11 11:02:49,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-01-11 11:02:49,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-11 11:02:49,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-01-11 11:02:49,055 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-01-11 11:02:49,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:49,055 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-01-11 11:02:49,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-11 11:02:49,055 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-01-11 11:02:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-11 11:02:49,056 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:49,056 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-01-11 11:02:49,056 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:02:49,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:49,057 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-01-11 11:02:49,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:49,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:49,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:49,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:49,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:50,402 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-11 11:02:50,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:50,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:50,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:50,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:50,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:50,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:02:50,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:50,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:50,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-11 11:02:50,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:50,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:52,805 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-11 11:02:52,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:55,229 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-11 11:02:55,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:55,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-01-11 11:02:55,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:55,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-11 11:02:55,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-11 11:02:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:02:55,248 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-01-11 11:03:06,199 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-11 11:03:06,495 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-11 11:03:09,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:09,070 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-01-11 11:03:09,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-01-11 11:03:09,070 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-01-11 11:03:09,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:09,072 INFO L225 Difference]: With dead ends: 363 [2019-01-11 11:03:09,072 INFO L226 Difference]: Without dead ends: 212 [2019-01-11 11:03:09,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-01-11 11:03:09,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-11 11:03:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-01-11 11:03:09,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-11 11:03:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-01-11 11:03:09,096 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-01-11 11:03:09,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:09,096 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-01-11 11:03:09,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-11 11:03:09,096 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-01-11 11:03:09,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-11 11:03:09,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:09,097 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-01-11 11:03:09,097 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:09,098 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-01-11 11:03:09,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:09,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:09,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:09,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:10,554 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-11 11:03:10,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:10,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:10,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:10,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:10,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:10,555 INFO 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-11 11:03:10,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:10,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:10,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:10,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:10,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:11,695 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-11 11:03:11,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:11,814 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-11 11:03:11,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:11,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-01-11 11:03:11,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:11,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-11 11:03:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-11 11:03:11,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 11:03:11,833 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-01-11 11:03:16,248 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-11 11:03:16,526 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-11 11:03:16,787 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-01-11 11:03:16,974 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-11 11:03:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:18,727 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-01-11 11:03:18,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 11:03:18,728 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-01-11 11:03:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:18,729 INFO L225 Difference]: With dead ends: 304 [2019-01-11 11:03:18,729 INFO L226 Difference]: Without dead ends: 226 [2019-01-11 11:03:18,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-01-11 11:03:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-01-11 11:03:18,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-01-11 11:03:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-11 11:03:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-01-11 11:03:18,764 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-01-11 11:03:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:18,765 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-01-11 11:03:18,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-11 11:03:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-01-11 11:03:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-11 11:03:18,766 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:18,766 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-11 11:03:18,766 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:18,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-01-11 11:03:18,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:18,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:18,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:18,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:18,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:19,937 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-11 11:03:19,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:19,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:19,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:19,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:19,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:19,938 INFO 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-11 11:03:19,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:19,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:19,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:21,079 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-11 11:03:21,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:21,615 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-11 11:03:21,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:21,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-01-11 11:03:21,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:21,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-11 11:03:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-11 11:03:21,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 11:03:21,635 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-01-11 11:03:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:22,969 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-01-11 11:03:22,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 11:03:22,969 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-01-11 11:03:22,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:22,970 INFO L225 Difference]: With dead ends: 315 [2019-01-11 11:03:22,970 INFO L226 Difference]: Without dead ends: 152 [2019-01-11 11:03:22,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:03:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-01-11 11:03:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-01-11 11:03:23,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-01-11 11:03:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-01-11 11:03:23,006 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-01-11 11:03:23,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:23,007 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-01-11 11:03:23,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-11 11:03:23,007 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-01-11 11:03:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-01-11 11:03:23,008 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:23,008 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-01-11 11:03:23,008 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:23,009 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-01-11 11:03:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:23,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:23,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:24,585 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-11 11:03:24,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:24,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:24,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:24,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:24,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:24,586 INFO 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-11 11:03:24,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:24,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:24,888 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-11 11:03:24,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:24,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:27,988 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-11 11:03:27,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:30,821 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-11 11:03:30,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:30,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-01-11 11:03:30,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:30,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-11 11:03:30,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-11 11:03:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 11:03:30,844 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-01-11 11:03:42,914 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-11 11:03:43,228 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-11 11:03:43,541 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-01-11 11:03:43,835 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:03:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:46,637 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-01-11 11:03:46,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-01-11 11:03:46,637 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-01-11 11:03:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:46,639 INFO L225 Difference]: With dead ends: 401 [2019-01-11 11:03:46,639 INFO L226 Difference]: Without dead ends: 234 [2019-01-11 11:03:46,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-01-11 11:03:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-11 11:03:46,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-01-11 11:03:46,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-11 11:03:46,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-01-11 11:03:46,673 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-01-11 11:03:46,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:46,673 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-01-11 11:03:46,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-11 11:03:46,674 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-01-11 11:03:46,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-11 11:03:46,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:46,675 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-01-11 11:03:46,675 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:03:46,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:46,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-01-11 11:03:46,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:46,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:46,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:46,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:48,532 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-11 11:03:48,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:48,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:48,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:48,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:48,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:48,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 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-11 11:03:48,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:48,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:48,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:48,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:48,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:50,886 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-11 11:03:50,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:51,102 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-11 11:03:51,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:51,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-01-11 11:03:51,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:51,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-11 11:03:51,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-11 11:03:51,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:03:51,121 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-01-11 11:03:57,139 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-11 11:03:57,465 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-11 11:03:57,769 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-01-11 11:03:58,017 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:03:58,220 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:04:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:00,282 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-01-11 11:04:00,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-11 11:04:00,282 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-01-11 11:04:00,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:00,284 INFO L225 Difference]: With dead ends: 334 [2019-01-11 11:04:00,284 INFO L226 Difference]: Without dead ends: 248 [2019-01-11 11:04:00,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-01-11 11:04:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-11 11:04:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-01-11 11:04:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-11 11:04:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-01-11 11:04:00,311 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-01-11 11:04:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:00,311 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-01-11 11:04:00,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-11 11:04:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-01-11 11:04:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-11 11:04:00,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:00,313 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-11 11:04:00,313 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:00,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:00,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-01-11 11:04:00,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:00,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:00,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:00,314 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:01,192 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-11 11:04:01,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:01,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:01,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:01,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:01,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:01,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:04:01,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:01,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:01,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:02,363 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-11 11:04:02,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:03,000 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-11 11:04:03,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:03,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-01-11 11:04:03,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:03,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-11 11:04:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-11 11:04:03,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:04:03,021 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-01-11 11:04:04,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:04,641 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-01-11 11:04:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 11:04:04,643 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-01-11 11:04:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:04,644 INFO L225 Difference]: With dead ends: 345 [2019-01-11 11:04:04,644 INFO L226 Difference]: Without dead ends: 166 [2019-01-11 11:04:04,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 11:04:04,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-11 11:04:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-01-11 11:04:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-11 11:04:04,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-01-11 11:04:04,672 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-01-11 11:04:04,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:04,672 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-01-11 11:04:04,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-11 11:04:04,672 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-01-11 11:04:04,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-11 11:04:04,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:04,673 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-01-11 11:04:04,673 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:04,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:04,673 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-01-11 11:04:04,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:04,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:04,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:04,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:04,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:06,166 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-11 11:04:06,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:06,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:06,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:06,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:06,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:06,166 INFO 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-11 11:04:06,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:06,176 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:06,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-11 11:04:06,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:06,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:07,932 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-11 11:04:07,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:08,078 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-11 11:04:08,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:08,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-01-11 11:04:08,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:08,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 11:04:08,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 11:04:08,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:04:08,099 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-01-11 11:04:15,143 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-11 11:04:15,479 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-11 11:04:15,802 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-01-11 11:04:16,021 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:04:16,230 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:04:16,453 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:04:16,716 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-11 11:04:18,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:18,641 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-01-11 11:04:18,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-11 11:04:18,642 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-01-11 11:04:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:18,643 INFO L225 Difference]: With dead ends: 349 [2019-01-11 11:04:18,643 INFO L226 Difference]: Without dead ends: 259 [2019-01-11 11:04:18,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-01-11 11:04:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-11 11:04:18,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-01-11 11:04:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-01-11 11:04:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-01-11 11:04:18,671 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-01-11 11:04:18,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:18,671 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-01-11 11:04:18,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 11:04:18,671 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-01-11 11:04:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-01-11 11:04:18,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:18,672 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-11 11:04:18,672 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:18,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-01-11 11:04:18,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:18,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:18,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:18,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:18,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:19,564 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-11 11:04:19,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:19,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:19,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:19,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:19,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:19,565 INFO 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-11 11:04:19,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:19,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:19,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:19,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:19,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:20,580 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-11 11:04:20,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:21,288 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-11 11:04:21,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:21,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-01-11 11:04:21,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:21,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 11:04:21,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 11:04:21,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:04:21,320 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-01-11 11:04:23,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:23,385 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-01-11 11:04:23,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 11:04:23,385 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-01-11 11:04:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:23,386 INFO L225 Difference]: With dead ends: 360 [2019-01-11 11:04:23,386 INFO L226 Difference]: Without dead ends: 173 [2019-01-11 11:04:23,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:04:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-11 11:04:23,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-01-11 11:04:23,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-11 11:04:23,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-01-11 11:04:23,434 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-01-11 11:04:23,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:23,434 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-01-11 11:04:23,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 11:04:23,434 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-01-11 11:04:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-11 11:04:23,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:23,435 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-01-11 11:04:23,436 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:23,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:23,436 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-01-11 11:04:23,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:23,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:23,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:23,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:25,374 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-11 11:04:25,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:25,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:25,375 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:25,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:25,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:25,375 INFO 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-11 11:04:25,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:25,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:25,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:27,331 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-11 11:04:27,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:27,523 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-11 11:04:27,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:27,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-01-11 11:04:27,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:27,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-11 11:04:27,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-11 11:04:27,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 11:04:27,544 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-01-11 11:04:35,173 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-11 11:04:35,534 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-11 11:04:35,872 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-01-11 11:04:36,097 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:04:36,332 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:04:36,555 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:04:36,770 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:04:37,215 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-11 11:04:38,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:38,962 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-01-11 11:04:38,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-11 11:04:38,963 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-01-11 11:04:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:38,964 INFO L225 Difference]: With dead ends: 364 [2019-01-11 11:04:38,965 INFO L226 Difference]: Without dead ends: 270 [2019-01-11 11:04:38,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-01-11 11:04:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-11 11:04:38,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-01-11 11:04:38,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-11 11:04:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-01-11 11:04:38,996 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-01-11 11:04:38,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:38,996 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-01-11 11:04:38,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-11 11:04:38,997 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-01-11 11:04:38,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-11 11:04:38,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:38,997 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-11 11:04:38,997 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:38,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:38,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-01-11 11:04:38,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:38,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:38,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:38,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:38,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:40,782 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-11 11:04:40,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:40,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:40,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:40,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:40,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:40,783 INFO 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-11 11:04:40,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:40,801 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:40,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-11 11:04:40,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:40,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:42,368 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-11 11:04:42,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:43,225 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-11 11:04:43,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:43,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-01-11 11:04:43,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:43,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-11 11:04:43,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-11 11:04:43,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 11:04:43,245 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-01-11 11:04:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:45,091 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-01-11 11:04:45,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 11:04:45,092 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-01-11 11:04:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:45,093 INFO L225 Difference]: With dead ends: 375 [2019-01-11 11:04:45,093 INFO L226 Difference]: Without dead ends: 180 [2019-01-11 11:04:45,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 11:04:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-11 11:04:45,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-01-11 11:04:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-11 11:04:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-01-11 11:04:45,133 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-01-11 11:04:45,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:45,133 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-01-11 11:04:45,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-11 11:04:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-01-11 11:04:45,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-01-11 11:04:45,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:45,134 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-01-11 11:04:45,134 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:45,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-01-11 11:04:45,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:45,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:45,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:45,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:45,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:46,940 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-11 11:04:46,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:46,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:46,941 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:46,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:46,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:46,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 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-11 11:04:46,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:46,949 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:46,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:46,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:46,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:48,882 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-11 11:04:48,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:49,047 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-11 11:04:49,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:49,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-01-11 11:04:49,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:49,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 11:04:49,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 11:04:49,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:04:49,068 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-01-11 11:04:55,572 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-11 11:04:55,956 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-11 11:04:56,315 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-01-11 11:04:56,558 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:04:56,794 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:04:57,016 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:04:57,233 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:04:57,445 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:04:57,687 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-11 11:04:57,915 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-11 11:04:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:59,742 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-01-11 11:04:59,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-11 11:04:59,742 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-01-11 11:04:59,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:59,744 INFO L225 Difference]: With dead ends: 379 [2019-01-11 11:04:59,744 INFO L226 Difference]: Without dead ends: 281 [2019-01-11 11:04:59,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2019-01-11 11:04:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-11 11:04:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-01-11 11:04:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-11 11:04:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-01-11 11:04:59,784 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-01-11 11:04:59,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:59,785 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-01-11 11:04:59,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 11:04:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-01-11 11:04:59,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-11 11:04:59,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:59,786 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-11 11:04:59,786 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:04:59,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:59,787 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-01-11 11:04:59,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:59,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:59,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:59,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:59,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:00,928 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-11 11:05:00,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:00,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:00,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:00,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:00,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:00,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:05:00,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:00,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:00,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:02,122 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-11 11:05:02,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:03,195 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-11 11:05:03,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:03,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-01-11 11:05:03,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:03,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 11:05:03,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 11:05:03,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:05:03,217 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-01-11 11:05:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:05,237 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-01-11 11:05:05,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 11:05:05,238 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-01-11 11:05:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:05,239 INFO L225 Difference]: With dead ends: 390 [2019-01-11 11:05:05,239 INFO L226 Difference]: Without dead ends: 187 [2019-01-11 11:05:05,240 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-11 11:05:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-11 11:05:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-01-11 11:05:05,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 11:05:05,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-01-11 11:05:05,281 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-01-11 11:05:05,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:05,281 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-01-11 11:05:05,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 11:05:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-01-11 11:05:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-11 11:05:05,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:05,289 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-01-11 11:05:05,289 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:05,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:05,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-01-11 11:05:05,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:05,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:05,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:05,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:05,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:07,579 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-11 11:05:07,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:07,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:07,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:07,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:07,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:07,580 INFO 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-11 11:05:07,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:07,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:07,642 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-11 11:05:07,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:07,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:12,139 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-11 11:05:12,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:16,261 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-11 11:05:16,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:16,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-01-11 11:05:16,280 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:16,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-11 11:05:16,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-11 11:05:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-01-11 11:05:16,282 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-01-11 11:05:34,269 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-11 11:05:34,713 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-11 11:05:35,180 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-01-11 11:05:35,573 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:05:35,960 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:05:36,319 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:05:36,654 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:05:36,983 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:05:37,314 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:05:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:40,546 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-01-11 11:05:40,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-01-11 11:05:40,547 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-01-11 11:05:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:40,549 INFO L225 Difference]: With dead ends: 496 [2019-01-11 11:05:40,549 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 11:05:40,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-01-11 11:05:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 11:05:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-01-11 11:05:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-11 11:05:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-01-11 11:05:40,587 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-01-11 11:05:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:40,588 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-01-11 11:05:40,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-11 11:05:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-01-11 11:05:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-11 11:05:40,588 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:40,589 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-01-11 11:05:40,589 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-01-11 11:05:40,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:40,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:40,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:40,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:40,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:42,594 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-11 11:05:42,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:42,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:42,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:42,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:42,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:42,595 INFO 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-11 11:05:42,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:05:42,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:05:42,633 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:05:42,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:42,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:44,805 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-11 11:05:44,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:45,159 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-11 11:05:45,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:45,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-01-11 11:05:45,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:45,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 11:05:45,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 11:05:45,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:05:45,180 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-01-11 11:05:53,538 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-11 11:05:53,996 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-11 11:05:54,453 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-01-11 11:05:54,723 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:05:54,998 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:05:55,259 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:05:55,508 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:05:55,745 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:05:55,972 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:05:56,196 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:05:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:58,518 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-01-11 11:05:58,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-11 11:05:58,529 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-01-11 11:05:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:58,530 INFO L225 Difference]: With dead ends: 409 [2019-01-11 11:05:58,530 INFO L226 Difference]: Without dead ends: 303 [2019-01-11 11:05:58,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:05:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-01-11 11:05:58,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-01-11 11:05:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-11 11:05:58,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-01-11 11:05:58,567 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-01-11 11:05:58,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:58,567 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-01-11 11:05:58,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 11:05:58,567 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-01-11 11:05:58,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-11 11:05:58,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:58,568 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-11 11:05:58,568 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:05:58,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-01-11 11:05:58,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:58,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:58,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:58,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:58,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:59,875 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-11 11:05:59,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:59,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:59,876 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:59,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:59,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:59,876 INFO 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-11 11:05:59,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:59,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:59,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:03,194 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-11 11:06:03,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:04,220 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-11 11:06:04,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:04,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-01-11 11:06:04,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:04,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 11:06:04,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 11:06:04,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:06:04,240 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-01-11 11:06:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:06,640 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-01-11 11:06:06,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 11:06:06,640 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-01-11 11:06:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:06,641 INFO L225 Difference]: With dead ends: 420 [2019-01-11 11:06:06,641 INFO L226 Difference]: Without dead ends: 201 [2019-01-11 11:06:06,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-01-11 11:06:06,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-11 11:06:06,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-01-11 11:06:06,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-11 11:06:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-01-11 11:06:06,688 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-01-11 11:06:06,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:06,688 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-01-11 11:06:06,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 11:06:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-01-11 11:06:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-11 11:06:06,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:06,689 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-01-11 11:06:06,689 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-01-11 11:06:06,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:06,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:06,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:08,608 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-11 11:06:08,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:08,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:08,609 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:08,609 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:08,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:08,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:06:08,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:06:08,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:06:08,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-11 11:06:08,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:08,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:10,967 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-11 11:06:10,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:11,175 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-11 11:06:11,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:11,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-01-11 11:06:11,194 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:11,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-11 11:06:11,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-11 11:06:11,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 11:06:11,195 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-01-11 11:06:19,893 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-11 11:06:20,312 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-11 11:06:20,729 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-01-11 11:06:21,024 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:06:21,310 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:06:21,586 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:06:21,853 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:06:22,117 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:06:22,367 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:06:22,609 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:06:22,845 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:06:25,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:25,385 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-01-11 11:06:25,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-01-11 11:06:25,385 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-01-11 11:06:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:25,387 INFO L225 Difference]: With dead ends: 424 [2019-01-11 11:06:25,388 INFO L226 Difference]: Without dead ends: 314 [2019-01-11 11:06:25,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-01-11 11:06:25,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-11 11:06:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-01-11 11:06:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-11 11:06:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-01-11 11:06:25,439 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-01-11 11:06:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:25,439 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-01-11 11:06:25,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-11 11:06:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-01-11 11:06:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-11 11:06:25,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:25,440 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-11 11:06:25,441 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:25,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:25,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-01-11 11:06:25,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:25,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:25,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:26,565 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-11 11:06:26,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:26,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:26,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:26,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:26,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:26,566 INFO 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-11 11:06:26,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:26,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:26,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:26,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:26,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:27,943 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-11 11:06:27,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:28,957 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-11 11:06:28,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:28,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-01-11 11:06:28,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:28,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-11 11:06:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-11 11:06:28,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 11:06:28,977 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-01-11 11:06:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:31,717 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-01-11 11:06:31,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 11:06:31,718 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-01-11 11:06:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:31,719 INFO L225 Difference]: With dead ends: 435 [2019-01-11 11:06:31,719 INFO L226 Difference]: Without dead ends: 208 [2019-01-11 11:06:31,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-01-11 11:06:31,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-11 11:06:31,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-01-11 11:06:31,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-11 11:06:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-01-11 11:06:31,769 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-01-11 11:06:31,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:31,770 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-01-11 11:06:31,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-11 11:06:31,770 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-01-11 11:06:31,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-11 11:06:31,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:31,771 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-01-11 11:06:31,771 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:31,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:31,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-01-11 11:06:31,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:31,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:31,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:31,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:31,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:33,911 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-11 11:06:33,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:33,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:33,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:33,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:33,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:33,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 11:06:33,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:33,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:06:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:33,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:36,354 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-11 11:06:36,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:36,545 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-11 11:06:36,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:36,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-01-11 11:06:36,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:36,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 11:06:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 11:06:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:06:36,565 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-01-11 11:06:45,838 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-11 11:06:46,278 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-11 11:06:46,716 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-01-11 11:06:47,022 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:06:47,326 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:06:47,607 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:06:47,891 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:06:48,171 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:06:48,437 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:06:48,691 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:06:48,929 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:06:49,163 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:06:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:51,739 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-01-11 11:06:51,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-01-11 11:06:51,739 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-01-11 11:06:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:51,741 INFO L225 Difference]: With dead ends: 439 [2019-01-11 11:06:51,741 INFO L226 Difference]: Without dead ends: 325 [2019-01-11 11:06:51,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:06:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-11 11:06:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-01-11 11:06:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-11 11:06:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-01-11 11:06:51,799 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-01-11 11:06:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:51,799 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-01-11 11:06:51,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 11:06:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-01-11 11:06:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-01-11 11:06:51,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:51,801 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-11 11:06:51,801 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:51,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:51,801 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-01-11 11:06:51,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:51,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:51,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:51,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:51,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:53,739 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-11 11:06:53,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:53,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:53,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:53,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:53,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:53,740 INFO 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-11 11:06:53,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:06:53,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:06:53,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-11 11:06:53,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:53,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:55,516 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-11 11:06:55,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:56,732 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-11 11:06:56,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:56,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-01-11 11:06:56,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:56,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 11:06:56,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 11:06:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:06:56,751 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-01-11 11:06:59,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:59,367 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-01-11 11:06:59,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 11:06:59,368 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-01-11 11:06:59,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:59,369 INFO L225 Difference]: With dead ends: 450 [2019-01-11 11:06:59,369 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 11:06:59,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:06:59,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 11:06:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-01-11 11:06:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-11 11:06:59,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-01-11 11:06:59,419 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-01-11 11:06:59,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:59,420 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-01-11 11:06:59,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 11:06:59,420 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-01-11 11:06:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-11 11:06:59,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:59,421 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-01-11 11:06:59,422 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:06:59,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:59,422 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-01-11 11:06:59,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:59,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:59,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:59,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:59,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:01,742 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-11 11:07:01,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:01,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:01,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:01,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:01,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:01,742 INFO 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-11 11:07:01,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:07:01,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:07:01,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:07:01,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:01,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:04,404 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-11 11:07:04,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:04,635 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-11 11:07:04,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:04,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-01-11 11:07:04,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:04,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-11 11:07:04,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-11 11:07:04,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:07:04,655 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-01-11 11:07:15,026 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-11 11:07:15,492 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-11 11:07:16,017 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-01-11 11:07:16,359 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 11:07:16,665 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:07:16,965 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:07:17,257 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:07:17,569 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:07:17,838 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:07:18,106 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:07:18,357 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:07:18,602 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:07:18,835 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:07:21,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:21,581 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-01-11 11:07:21,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-01-11 11:07:21,582 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-01-11 11:07:21,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:21,584 INFO L225 Difference]: With dead ends: 454 [2019-01-11 11:07:21,584 INFO L226 Difference]: Without dead ends: 336 [2019-01-11 11:07:21,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-01-11 11:07:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-01-11 11:07:21,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-01-11 11:07:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-11 11:07:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-01-11 11:07:21,636 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-01-11 11:07:21,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:21,636 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-01-11 11:07:21,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-11 11:07:21,636 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-01-11 11:07:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-11 11:07:21,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:21,637 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-11 11:07:21,637 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:21,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:21,637 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-01-11 11:07:21,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:21,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:21,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:21,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:21,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:22,887 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-11 11:07:22,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:22,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:22,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:22,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:22,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:22,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:22,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:22,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:07:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:22,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:24,449 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-11 11:07:24,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:25,568 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-11 11:07:25,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:25,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-01-11 11:07:25,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:25,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-11 11:07:25,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-11 11:07:25,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:07:25,588 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-01-11 11:07:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:28,557 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-01-11 11:07:28,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 11:07:28,557 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-01-11 11:07:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:28,558 INFO L225 Difference]: With dead ends: 465 [2019-01-11 11:07:28,558 INFO L226 Difference]: Without dead ends: 222 [2019-01-11 11:07:28,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-01-11 11:07:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-01-11 11:07:28,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-01-11 11:07:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-11 11:07:28,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-01-11 11:07:28,607 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-01-11 11:07:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:28,607 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-01-11 11:07:28,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-11 11:07:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-01-11 11:07:28,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-11 11:07:28,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:28,608 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-01-11 11:07:28,608 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:07:28,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:28,609 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-01-11 11:07:28,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:28,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:28,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:28,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:28,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:30,782 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-11 11:07:30,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:30,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:30,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:30,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:30,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:30,783 INFO 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-11 11:07:30,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:07:30,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:07:30,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-11 11:07:30,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:30,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:37,105 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-11 11:07:37,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:42,744 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-11 11:07:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:42,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-01-11 11:07:42,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:42,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-11 11:07:42,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-11 11:07:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:07:42,765 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-01-11 11:08:07,049 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-11 11:08:07,670 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-11 11:08:08,254 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-01-11 11:08:08,765 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 11:08:09,265 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 11:08:09,753 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:08:10,241 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:08:10,691 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:08:11,131 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:08:11,555 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:08:11,955 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:08:12,407 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:08:12,782 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:08:13,143 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:08:16,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:16,721 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-01-11 11:08:16,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-01-11 11:08:16,721 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-01-11 11:08:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:16,722 INFO L225 Difference]: With dead ends: 591 [2019-01-11 11:08:16,722 INFO L226 Difference]: Without dead ends: 344 [2019-01-11 11:08:16,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.6s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-01-11 11:08:16,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-11 11:08:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-01-11 11:08:16,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-11 11:08:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-01-11 11:08:16,771 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-01-11 11:08:16,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:16,772 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-01-11 11:08:16,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-11 11:08:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-01-11 11:08:16,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-11 11:08:16,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:16,773 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-01-11 11:08:16,774 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:16,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:16,774 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-01-11 11:08:16,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:16,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:16,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:16,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:19,408 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-11 11:08:19,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:19,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:19,408 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:19,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:19,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:19,408 INFO 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-11 11:08:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:08:19,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:08:19,454 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:08:19,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:19,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:21,985 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-11 11:08:21,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:22,205 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-11 11:08:22,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-01-11 11:08:22,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:22,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-11 11:08:22,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-11 11:08:22,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:08:22,226 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-01-11 11:08:35,325 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-11 11:08:35,830 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-11 11:08:36,322 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-01-11 11:08:36,659 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 11:08:37,001 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 11:08:37,335 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 11:08:37,703 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:08:38,073 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:08:38,376 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:08:38,677 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:08:38,970 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:08:39,246 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:08:39,508 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:08:39,768 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:08:40,018 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:08:40,255 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-11 11:08:42,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:42,712 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-01-11 11:08:42,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-01-11 11:08:42,713 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-01-11 11:08:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:42,715 INFO L225 Difference]: With dead ends: 484 [2019-01-11 11:08:42,715 INFO L226 Difference]: Without dead ends: 358 [2019-01-11 11:08:42,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-01-11 11:08:42,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-01-11 11:08:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-01-11 11:08:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-11 11:08:42,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-01-11 11:08:42,768 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-01-11 11:08:42,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:42,768 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-01-11 11:08:42,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-11 11:08:42,769 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-01-11 11:08:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-11 11:08:42,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:42,770 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-11 11:08:42,770 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:42,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:42,770 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-01-11 11:08:42,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:42,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:42,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:42,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:42,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:44,257 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-11 11:08:44,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:44,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:44,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:44,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:44,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:44,258 INFO 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-11 11:08:44,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:44,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:08:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:44,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:46,034 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-11 11:08:46,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:47,559 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-11 11:08:47,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:47,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-01-11 11:08:47,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:47,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-11 11:08:47,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-11 11:08:47,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:08:47,579 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-01-11 11:08:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:50,074 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-01-11 11:08:50,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 11:08:50,075 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-01-11 11:08:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:50,076 INFO L225 Difference]: With dead ends: 495 [2019-01-11 11:08:50,076 INFO L226 Difference]: Without dead ends: 236 [2019-01-11 11:08:50,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:08:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-01-11 11:08:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-01-11 11:08:50,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-11 11:08:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-01-11 11:08:50,129 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-01-11 11:08:50,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:50,129 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-01-11 11:08:50,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-11 11:08:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-01-11 11:08:50,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-01-11 11:08:50,131 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:50,131 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-01-11 11:08:50,131 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:08:50,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:50,131 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-01-11 11:08:50,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:50,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:50,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:50,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:50,132 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:52,672 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-11 11:08:52,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:52,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:52,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:52,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:52,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:52,673 INFO 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-11 11:08:52,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:08:52,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:08:52,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-11 11:08:52,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:52,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:59,687 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-11 11:08:59,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:05,998 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-11 11:09:06,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:06,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-01-11 11:09:06,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:06,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-01-11 11:09:06,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-01-11 11:09:06,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:09:06,020 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-01-11 11:09:31,931 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-11 11:09:32,550 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-11 11:09:33,185 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-01-11 11:09:33,758 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 11:09:34,382 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 11:09:34,910 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 11:09:35,423 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 11:09:35,931 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:09:36,464 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:09:36,936 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:09:37,406 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:09:37,843 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:09:38,270 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:09:38,681 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:09:39,066 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:09:39,448 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:09:43,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:43,237 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-01-11 11:09:43,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-01-11 11:09:43,238 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-01-11 11:09:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:43,240 INFO L225 Difference]: With dead ends: 629 [2019-01-11 11:09:43,240 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 11:09:43,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 44.1s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-01-11 11:09:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 11:09:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-01-11 11:09:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-11 11:09:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-01-11 11:09:43,296 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-01-11 11:09:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:43,296 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-01-11 11:09:43,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-01-11 11:09:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-01-11 11:09:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-11 11:09:43,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:43,297 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-01-11 11:09:43,297 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:09:43,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-01-11 11:09:43,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:43,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:43,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:43,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:43,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:46,126 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-11 11:09:46,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:46,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:46,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:46,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:46,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:46,126 INFO 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-11 11:09:46,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:09:46,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:09:46,178 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:09:46,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:46,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:48,982 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-11 11:09:48,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:49,222 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-11 11:09:49,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:49,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-01-11 11:09:49,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:49,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-11 11:09:49,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-11 11:09:49,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 11:09:49,242 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-01-11 11:10:01,503 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-11 11:10:02,060 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-11 11:10:02,607 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-01-11 11:10:03,002 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 11:10:03,383 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 11:10:03,749 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 11:10:04,111 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 11:10:04,457 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 11:10:04,825 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:10:05,198 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:10:05,520 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:10:05,838 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:10:06,142 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:10:06,432 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:10:06,709 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:10:06,978 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:10:07,240 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:10:07,767 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-11 11:10:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:10,169 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-01-11 11:10:10,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-01-11 11:10:10,170 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-01-11 11:10:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:10,172 INFO L225 Difference]: With dead ends: 514 [2019-01-11 11:10:10,172 INFO L226 Difference]: Without dead ends: 380 [2019-01-11 11:10:10,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-01-11 11:10:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-11 11:10:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-01-11 11:10:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-01-11 11:10:10,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-01-11 11:10:10,229 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-01-11 11:10:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:10,229 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-01-11 11:10:10,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-11 11:10:10,230 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-01-11 11:10:10,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-11 11:10:10,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:10,231 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-11 11:10:10,231 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-01-11 11:10:10,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:10,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:10,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:10,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:10,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:11,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:11,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:11,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:11,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:11,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:11,765 INFO 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-11 11:10:11,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:11,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:11,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:13,819 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-11 11:10:13,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:15,538 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-11 11:10:15,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:15,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-01-11 11:10:15,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:15,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-11 11:10:15,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-11 11:10:15,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 11:10:15,560 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-01-11 11:10:18,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:18,166 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-01-11 11:10:18,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 11:10:18,166 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-01-11 11:10:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:18,168 INFO L225 Difference]: With dead ends: 525 [2019-01-11 11:10:18,168 INFO L226 Difference]: Without dead ends: 250 [2019-01-11 11:10:18,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-01-11 11:10:18,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-11 11:10:18,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-01-11 11:10:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-11 11:10:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-01-11 11:10:18,223 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-01-11 11:10:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:18,223 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-01-11 11:10:18,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-11 11:10:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-01-11 11:10:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-01-11 11:10:18,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:18,225 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-01-11 11:10:18,225 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:10:18,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:18,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-01-11 11:10:18,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:18,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:18,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:18,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:21,142 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-11 11:10:21,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:21,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:21,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:21,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:21,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:21,143 INFO 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-11 11:10:21,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:10:21,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:10:21,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-11 11:10:21,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:21,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:28,658 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-11 11:10:28,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:35,947 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-11 11:10:35,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:35,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-01-11 11:10:35,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:35,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-01-11 11:10:35,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-01-11 11:10:35,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 11:10:35,968 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-01-11 11:11:03,751 WARN L181 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-11 11:11:04,398 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-11 11:11:05,063 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-01-11 11:11:05,684 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-11 11:11:06,334 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 11:11:06,933 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 11:11:07,496 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 11:11:08,052 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 11:11:08,596 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 11:11:09,136 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:11:09,648 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:11:10,155 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:11:10,644 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:11:11,113 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:11:11,664 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:11:12,089 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:11:12,493 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:11:12,882 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:11:16,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:16,907 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-01-11 11:11:16,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-01-11 11:11:16,907 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-01-11 11:11:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:16,909 INFO L225 Difference]: With dead ends: 667 [2019-01-11 11:11:16,909 INFO L226 Difference]: Without dead ends: 388 [2019-01-11 11:11:16,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-01-11 11:11:16,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-01-11 11:11:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-01-11 11:11:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-01-11 11:11:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-01-11 11:11:16,974 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-01-11 11:11:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:16,974 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-01-11 11:11:16,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-01-11 11:11:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-01-11 11:11:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-01-11 11:11:16,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:16,976 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-01-11 11:11:16,976 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:16,977 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-01-11 11:11:16,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:16,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:16,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:19,855 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-11 11:11:19,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:19,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:19,855 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:19,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:19,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:19,856 INFO 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-11 11:11:19,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:11:19,864 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:11:19,906 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:11:19,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:19,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:23,137 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-11 11:11:23,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:23,416 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-11 11:11:23,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:23,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-01-11 11:11:23,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:23,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-11 11:11:23,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-11 11:11:23,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 11:11:23,436 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-01-11 11:11:37,691 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-11 11:11:38,286 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-11 11:11:38,874 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-01-11 11:11:39,291 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-11 11:11:39,707 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-11 11:11:40,102 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 11:11:40,493 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 11:11:40,876 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 11:11:41,245 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 11:11:41,609 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 11:11:41,960 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:11:42,385 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:11:42,735 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:11:43,060 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:11:43,376 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:11:43,681 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:11:43,972 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:11:44,263 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:11:44,534 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:11:47,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:47,589 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-01-11 11:11:47,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-01-11 11:11:47,589 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-01-11 11:11:47,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:47,592 INFO L225 Difference]: With dead ends: 544 [2019-01-11 11:11:47,592 INFO L226 Difference]: Without dead ends: 402 [2019-01-11 11:11:47,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-01-11 11:11:47,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-01-11 11:11:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-01-11 11:11:47,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-01-11 11:11:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-01-11 11:11:47,655 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-01-11 11:11:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:47,655 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-01-11 11:11:47,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-11 11:11:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-01-11 11:11:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-11 11:11:47,657 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:47,657 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-11 11:11:47,657 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:47,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-01-11 11:11:47,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:47,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:47,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:47,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:47,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:49,368 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-11 11:11:49,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:49,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:49,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:49,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:49,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:49,369 INFO 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-11 11:11:49,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:49,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:49,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:51,549 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-11 11:11:51,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:53,437 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-11 11:11:53,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:53,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-01-11 11:11:53,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:53,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-11 11:11:53,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-11 11:11:53,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 11:11:53,458 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-01-11 11:11:56,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:56,373 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-01-11 11:11:56,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 11:11:56,373 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-01-11 11:11:56,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:56,375 INFO L225 Difference]: With dead ends: 555 [2019-01-11 11:11:56,375 INFO L226 Difference]: Without dead ends: 264 [2019-01-11 11:11:56,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-01-11 11:11:56,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-11 11:11:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-01-11 11:11:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-11 11:11:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-01-11 11:11:56,438 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-01-11 11:11:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:56,438 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-01-11 11:11:56,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-11 11:11:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-01-11 11:11:56,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-11 11:11:56,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:56,440 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-01-11 11:11:56,440 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:11:56,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:56,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-01-11 11:11:56,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:56,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:56,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:56,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:56,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:59,623 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-11 11:11:59,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:59,623 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:59,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:59,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:59,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:59,624 INFO 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-11 11:11:59,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:59,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:59,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-11 11:11:59,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:59,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:08,266 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-11 11:12:08,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:15,951 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-11 11:12:15,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:15,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-01-11 11:12:15,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:15,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-11 11:12:15,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-11 11:12:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-01-11 11:12:15,973 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-01-11 11:12:43,760 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-11 11:12:47,564 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-11 11:12:48,316 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-11 11:12:49,108 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-01-11 11:12:49,796 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-11 11:12:50,463 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-11 11:12:51,122 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-11 11:12:51,765 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 11:12:52,386 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 11:12:53,037 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 11:12:53,633 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 11:12:54,261 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 11:12:54,810 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:12:55,346 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:12:55,868 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:12:56,380 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:12:56,865 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:12:57,326 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:12:57,766 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:12:58,210 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:12:58,631 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:12:59,087 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-11 11:13:02,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:02,988 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-01-11 11:13:02,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-01-11 11:13:02,989 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-01-11 11:13:02,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:02,991 INFO L225 Difference]: With dead ends: 705 [2019-01-11 11:13:02,991 INFO L226 Difference]: Without dead ends: 410 [2019-01-11 11:13:02,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 55.3s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-01-11 11:13:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-11 11:13:03,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-01-11 11:13:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-01-11 11:13:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-01-11 11:13:03,073 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-01-11 11:13:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:03,074 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-01-11 11:13:03,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-11 11:13:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-01-11 11:13:03,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-01-11 11:13:03,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:03,075 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-01-11 11:13:03,075 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:03,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:03,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-01-11 11:13:03,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:03,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:03,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:03,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:03,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:03,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:06,503 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-11 11:13:06,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:06,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:06,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:06,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:06,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:06,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 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-11 11:13:06,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:13:06,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:13:06,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:13:06,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:06,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:10,191 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-11 11:13:10,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:10,461 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-11 11:13:10,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:10,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-01-11 11:13:10,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:10,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-11 11:13:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-11 11:13:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 11:13:10,482 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-01-11 11:13:27,267 WARN L181 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-11 11:13:27,915 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-01-11 11:13:28,557 WARN L181 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-01-11 11:13:29,014 WARN L181 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-01-11 11:13:29,466 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-01-11 11:13:29,922 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-01-11 11:13:30,359 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-01-11 11:13:30,787 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-01-11 11:13:31,199 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-01-11 11:13:31,604 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-01-11 11:13:32,031 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-01-11 11:13:32,410 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-01-11 11:13:32,788 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-01-11 11:13:33,148 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-01-11 11:13:33,495 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-01-11 11:13:33,841 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-01-11 11:13:34,170 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-01-11 11:13:34,487 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-01-11 11:13:34,830 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-01-11 11:13:35,162 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-11 11:13:35,445 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-11 11:13:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:38,611 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-01-11 11:13:38,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-01-11 11:13:38,612 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-01-11 11:13:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:38,613 INFO L225 Difference]: With dead ends: 574 [2019-01-11 11:13:38,613 INFO L226 Difference]: Without dead ends: 424 [2019-01-11 11:13:38,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-01-11 11:13:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-11 11:13:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-01-11 11:13:38,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-11 11:13:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-01-11 11:13:38,702 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-01-11 11:13:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:38,702 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-01-11 11:13:38,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-11 11:13:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-01-11 11:13:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-01-11 11:13:38,703 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:38,703 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-11 11:13:38,704 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-01-11 11:13:38,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:38,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:38,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:38,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:38,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:40,881 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-11 11:13:40,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:40,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:40,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:40,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:40,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:40,882 INFO 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-11 11:13:40,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:40,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:40,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:43,262 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-11 11:13:43,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:45,321 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-11 11:13:45,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:45,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-01-11 11:13:45,340 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:45,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-11 11:13:45,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-11 11:13:45,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 11:13:45,342 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-01-11 11:13:48,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:48,645 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-01-11 11:13:48,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 11:13:48,645 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-01-11 11:13:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:48,647 INFO L225 Difference]: With dead ends: 585 [2019-01-11 11:13:48,647 INFO L226 Difference]: Without dead ends: 278 [2019-01-11 11:13:48,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:13:48,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-01-11 11:13:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-01-11 11:13:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 11:13:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-01-11 11:13:48,726 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-01-11 11:13:48,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:48,726 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-01-11 11:13:48,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-11 11:13:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-01-11 11:13:48,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-11 11:13:48,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:48,727 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-01-11 11:13:48,728 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 11:13:48,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:48,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-01-11 11:13:48,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:48,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:48,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:48,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:48,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:52,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:52,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:52,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:52,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:52,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:52,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:52,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:52,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:13:52,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:13:52,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-11 11:13:52,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:52,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:14:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:14:01,452 INFO L316 TraceCheckSpWp]: Computing backward predicates...