java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 18:05:58,435 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 18:05:58,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 18:05:58,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 18:05:58,453 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 18:05:58,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 18:05:58,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 18:05:58,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 18:05:58,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 18:05:58,464 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 18:05:58,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 18:05:58,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 18:05:58,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 18:05:58,474 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 18:05:58,478 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 18:05:58,480 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 18:05:58,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 18:05:58,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 18:05:58,488 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 18:05:58,492 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 18:05:58,494 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 18:05:58,495 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 18:05:58,498 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 18:05:58,498 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 18:05:58,499 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 18:05:58,500 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 18:05:58,502 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 18:05:58,503 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 18:05:58,503 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 18:05:58,507 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 18:05:58,507 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 18:05:58,508 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 18:05:58,508 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 18:05:58,508 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 18:05:58,510 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 18:05:58,511 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 18:05:58,511 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 18:05:58,526 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 18:05:58,526 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 18:05:58,527 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 18:05:58,527 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 18:05:58,527 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 18:05:58,528 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 18:05:58,528 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 18:05:58,528 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 18:05:58,528 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 18:05:58,528 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 18:05:58,528 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 18:05:58,529 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 18:05:58,529 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 18:05:58,529 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 18:05:58,530 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 18:05:58,530 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 18:05:58,530 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 18:05:58,530 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 18:05:58,530 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 18:05:58,535 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 18:05:58,535 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 18:05:58,535 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 18:05:58,535 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 18:05:58,536 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 18:05:58,536 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 18:05:58,536 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 18:05:58,536 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 18:05:58,536 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 18:05:58,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 18:05:58,537 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 18:05:58,537 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 18:05:58,537 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 18:05:58,538 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 18:05:58,540 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 18:05:58,540 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 18:05:58,540 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 18:05:58,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 18:05:58,541 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 18:05:58,541 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 18:05:58,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 18:05:58,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 18:05:58,590 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 18:05:58,592 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 18:05:58,593 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 18:05:58,593 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl [2018-12-03 18:05:58,594 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/AnnoyingVillain.bpl' [2018-12-03 18:05:58,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 18:05:58,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 18:05:58,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 18:05:58,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 18:05:58,633 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 18:05:58,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/1) ... [2018-12-03 18:05:58,660 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/1) ... [2018-12-03 18:05:58,666 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 18:05:58,667 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 18:05:58,667 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 18:05:58,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 18:05:58,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 18:05:58,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 18:05:58,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 18:05:58,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/1) ... [2018-12-03 18:05:58,682 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/1) ... [2018-12-03 18:05:58,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/1) ... [2018-12-03 18:05:58,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/1) ... [2018-12-03 18:05:58,686 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/1) ... [2018-12-03 18:05:58,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/1) ... [2018-12-03 18:05:58,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/1) ... [2018-12-03 18:05:58,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 18:05:58,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 18:05:58,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 18:05:58,693 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 18:05:58,694 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (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:2024 -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:2024 -smt2 -in -t:2000 [2018-12-03 18:05:58,761 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 18:05:58,762 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 18:05:58,762 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 18:05:58,995 INFO L272 CfgBuilder]: Using library mode [2018-12-03 18:05:58,995 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 18:05:58,996 INFO L202 PluginConnector]: Adding new model AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:05:58 BoogieIcfgContainer [2018-12-03 18:05:58,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 18:05:58,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 18:05:58,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 18:05:59,002 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 18:05:59,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 06:05:58" (1/2) ... [2018-12-03 18:05:59,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@485da594 and model type AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:05:59, skipping insertion in model container [2018-12-03 18:05:59,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "AnnoyingVillain.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:05:58" (2/2) ... [2018-12-03 18:05:59,006 INFO L112 eAbstractionObserver]: Analyzing ICFG AnnoyingVillain.bpl [2018-12-03 18:05:59,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 18:05:59,030 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 18:05:59,051 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 18:05:59,097 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 18:05:59,097 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 18:05:59,097 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 18:05:59,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 18:05:59,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 18:05:59,098 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 18:05:59,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 18:05:59,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 18:05:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 18:05:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 18:05:59,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:05:59,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 18:05:59,139 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:05:59,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:05:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 18:05:59,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:05:59,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:59,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:05:59,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:59,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:05:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:05:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:59,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 18:05:59,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 18:05:59,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 18:05:59,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 18:05:59,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 18:05:59,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:05:59,345 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 18:05:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:05:59,402 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-03 18:05:59,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 18:05:59,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 18:05:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:05:59,416 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:05:59,417 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 18:05:59,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 18:05:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 18:05:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 18:05:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 18:05:59,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 18:05:59,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 18:05:59,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:05:59,457 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 18:05:59,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 18:05:59,457 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 18:05:59,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 18:05:59,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:05:59,458 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 18:05:59,458 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:05:59,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:05:59,459 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 18:05:59,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:05:59,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:59,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:05:59,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:05:59,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:05:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:05:59,622 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 5 [2018-12-03 18:05:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:05:59,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:05:59,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:05:59,707 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 18:05:59,711 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 18:05:59,804 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 18:05:59,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 18:05:59,890 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 18:05:59,953 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 18:05:59,954 INFO L272 AbstractInterpreter]: Visited 4 different actions 9 times. Merged at 2 different actions 3 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 18:06:00,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:00,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 18:06:00,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:00,003 INFO L192 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 [2018-12-03 18:06:00,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:00,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:06:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:00,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:00,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:00,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:00,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:00,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 18:06:00,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:00,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 18:06:00,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 18:06:00,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:06:00,372 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 18:06:00,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:00,419 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 18:06:00,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 18:06:00,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 18:06:00,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:00,420 INFO L225 Difference]: With dead ends: 9 [2018-12-03 18:06:00,421 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 18:06:00,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 18:06:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 18:06:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 18:06:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 18:06:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 18:06:00,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-12-03 18:06:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:00,425 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 18:06:00,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 18:06:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 18:06:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 18:06:00,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:00,426 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 18:06:00,426 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:00,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:00,427 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 2 times [2018-12-03 18:06:00,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:00,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:00,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:00,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:00,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:00,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:00,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:00,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:00,622 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:00,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:00,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:00,623 INFO L192 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 [2018-12-03 18:06:00,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:06:00,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:06:00,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 18:06:00,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:06:00,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:00,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:00,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:01,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:01,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 18:06:01,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:01,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 18:06:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 18:06:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:06:01,097 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 18:06:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:01,173 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 18:06:01,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 18:06:01,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 18:06:01,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:01,174 INFO L225 Difference]: With dead ends: 11 [2018-12-03 18:06:01,174 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 18:06:01,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-03 18:06:01,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 18:06:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 18:06:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 18:06:01,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 18:06:01,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-12-03 18:06:01,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:01,180 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 18:06:01,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 18:06:01,180 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 18:06:01,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 18:06:01,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:01,181 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 18:06:01,181 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:01,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 3 times [2018-12-03 18:06:01,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:01,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:01,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:06:01,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:01,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:01,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:01,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:01,484 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:01,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:01,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:01,485 INFO L192 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 [2018-12-03 18:06:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:06:01,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:06:01,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:06:01,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:06:01,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:01,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:02,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:02,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 18:06:02,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:02,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 18:06:02,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 18:06:02,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:06:02,318 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 18:06:02,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:02,703 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 18:06:02,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 18:06:02,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 18:06:02,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:02,705 INFO L225 Difference]: With dead ends: 13 [2018-12-03 18:06:02,705 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 18:06:02,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2018-12-03 18:06:02,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 18:06:02,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 18:06:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 18:06:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 18:06:02,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-12-03 18:06:02,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:02,710 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 18:06:02,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 18:06:02,711 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 18:06:02,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 18:06:02,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:02,711 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 18:06:02,712 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:02,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:02,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 4 times [2018-12-03 18:06:02,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:02,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:02,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:06:02,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:02,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:02,927 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:02,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:02,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:02,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:02,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:02,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:02,928 INFO L192 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 [2018-12-03 18:06:02,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:02,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:06:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:02,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:03,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:03,980 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:03,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:04,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 18:06:04,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:04,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 18:06:04,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 18:06:04,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:06:04,001 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 18:06:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:04,130 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 18:06:04,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 18:06:04,132 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 18:06:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:04,133 INFO L225 Difference]: With dead ends: 15 [2018-12-03 18:06:04,133 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 18:06:04,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-12-03 18:06:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 18:06:04,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 18:06:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 18:06:04,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 18:06:04,138 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-12-03 18:06:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:04,138 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 18:06:04,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 18:06:04,138 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 18:06:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 18:06:04,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:04,139 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 18:06:04,140 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:04,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:04,140 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 5 times [2018-12-03 18:06:04,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:04,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:04,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:04,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:04,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:04,623 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:04,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:04,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:04,624 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:04,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:04,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:04,625 INFO L192 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 [2018-12-03 18:06:04,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:06:04,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:06:04,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 18:06:04,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:06:04,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:04,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:05,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:05,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 18:06:05,828 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:05,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 18:06:05,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 18:06:05,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:06:05,829 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 18:06:06,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:06,118 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-03 18:06:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 18:06:06,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 18:06:06,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:06,119 INFO L225 Difference]: With dead ends: 17 [2018-12-03 18:06:06,119 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 18:06:06,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2018-12-03 18:06:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 18:06:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 18:06:06,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 18:06:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 18:06:06,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-12-03 18:06:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:06,124 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 18:06:06,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 18:06:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 18:06:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 18:06:06,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:06,125 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 18:06:06,125 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:06,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 6 times [2018-12-03 18:06:06,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:06,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:06,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:06:06,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:06,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:06,428 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:06,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:06,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:06,428 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:06,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:06,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:06,429 INFO L192 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 [2018-12-03 18:06:06,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:06:06,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:06:06,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:06:06,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:06:06,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:06,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:10,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:10,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 18:06:10,756 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:10,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 18:06:10,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 18:06:10,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=506, Unknown=1, NotChecked=0, Total=702 [2018-12-03 18:06:10,758 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 18:06:10,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:10,999 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-03 18:06:11,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 18:06:11,001 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 18:06:11,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:11,001 INFO L225 Difference]: With dead ends: 19 [2018-12-03 18:06:11,001 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 18:06:11,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=195, Invalid=506, Unknown=1, NotChecked=0, Total=702 [2018-12-03 18:06:11,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 18:06:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 18:06:11,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 18:06:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 18:06:11,007 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-12-03 18:06:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:11,008 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 18:06:11,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 18:06:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 18:06:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 18:06:11,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:11,009 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 18:06:11,009 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:11,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:11,010 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 7 times [2018-12-03 18:06:11,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:11,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:11,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:06:11,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:11,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:11,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:11,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:11,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:11,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:11,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:11,286 INFO L192 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 [2018-12-03 18:06:11,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:11,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:06:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:11,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:11,372 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:11,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:15,036 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:15,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:15,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 18:06:15,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:15,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 18:06:15,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 18:06:15,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=674, Unknown=1, NotChecked=0, Total=930 [2018-12-03 18:06:15,059 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 18:06:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:15,494 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 18:06:15,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 18:06:15,496 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 18:06:15,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:15,496 INFO L225 Difference]: With dead ends: 21 [2018-12-03 18:06:15,497 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 18:06:15,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=255, Invalid=674, Unknown=1, NotChecked=0, Total=930 [2018-12-03 18:06:15,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 18:06:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 18:06:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 18:06:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 18:06:15,504 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-12-03 18:06:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:15,505 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 18:06:15,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 18:06:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 18:06:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 18:06:15,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:15,507 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 18:06:15,507 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:15,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 8 times [2018-12-03 18:06:15,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:15,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:15,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:15,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:16,112 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:16,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:16,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:16,113 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:16,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:16,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:16,113 INFO L192 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 [2018-12-03 18:06:16,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:06:16,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:06:16,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 18:06:16,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:06:16,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:16,224 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:16,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:33,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:33,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 18:06:33,828 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:33,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 18:06:33,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 18:06:33,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=866, Unknown=7, NotChecked=0, Total=1190 [2018-12-03 18:06:33,830 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 18:06:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:34,257 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-03 18:06:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 18:06:34,258 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 18:06:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:34,259 INFO L225 Difference]: With dead ends: 23 [2018-12-03 18:06:34,259 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 18:06:34,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=317, Invalid=866, Unknown=7, NotChecked=0, Total=1190 [2018-12-03 18:06:34,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 18:06:34,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 18:06:34,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 18:06:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 18:06:34,265 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-12-03 18:06:34,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:34,265 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 18:06:34,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 18:06:34,266 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 18:06:34,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 18:06:34,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:34,267 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 18:06:34,267 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:34,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:34,267 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 9 times [2018-12-03 18:06:34,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:34,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:34,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:06:34,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:34,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:34,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:34,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:34,720 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:34,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:34,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:34,721 INFO L192 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 [2018-12-03 18:06:34,731 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:06:34,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:06:34,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:06:34,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:06:34,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:34,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:41,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:41,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 18:06:41,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:41,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 18:06:41,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 18:06:41,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=1082, Unknown=2, NotChecked=0, Total=1482 [2018-12-03 18:06:41,775 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 18:06:42,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:42,257 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-03 18:06:42,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 18:06:42,258 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 18:06:42,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:42,259 INFO L225 Difference]: With dead ends: 25 [2018-12-03 18:06:42,259 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 18:06:42,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=398, Invalid=1082, Unknown=2, NotChecked=0, Total=1482 [2018-12-03 18:06:42,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 18:06:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 18:06:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 18:06:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 18:06:42,266 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-12-03 18:06:42,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:42,267 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 18:06:42,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 18:06:42,267 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 18:06:42,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 18:06:42,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:42,268 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 18:06:42,268 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:42,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:42,269 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 10 times [2018-12-03 18:06:42,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:42,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:42,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:06:42,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:42,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:43,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:43,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:43,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:43,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:43,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:43,518 INFO L192 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 [2018-12-03 18:06:43,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:43,528 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:06:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:43,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:43,679 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:43,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:06:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:54,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:06:54,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 18:06:54,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:06:54,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 18:06:54,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 18:06:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=1322, Unknown=4, NotChecked=0, Total=1806 [2018-12-03 18:06:54,459 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 18:06:54,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:06:54,952 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 18:06:54,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 18:06:54,953 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 18:06:54,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:06:54,954 INFO L225 Difference]: With dead ends: 27 [2018-12-03 18:06:54,954 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 18:06:54,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=480, Invalid=1322, Unknown=4, NotChecked=0, Total=1806 [2018-12-03 18:06:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 18:06:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 18:06:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 18:06:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 18:06:54,961 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-12-03 18:06:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:06:54,961 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 18:06:54,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 18:06:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 18:06:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 18:06:54,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:06:54,963 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 18:06:54,963 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:06:54,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:06:54,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 11 times [2018-12-03 18:06:54,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:06:54,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:54,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:06:54,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:06:54,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:06:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:06:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:55,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:55,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:06:55,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:06:55,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:06:55,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:06:55,723 INFO L192 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 [2018-12-03 18:06:55,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:06:55,741 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:06:55,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 18:06:55,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:06:55,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:06:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:06:55,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:08,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:08,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 18:07:08,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:08,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 18:07:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 18:07:08,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1586, Unknown=4, NotChecked=0, Total=2162 [2018-12-03 18:07:08,186 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 18:07:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:10,806 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-12-03 18:07:10,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 18:07:10,807 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 18:07:10,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:10,808 INFO L225 Difference]: With dead ends: 29 [2018-12-03 18:07:10,808 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 18:07:10,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=572, Invalid=1586, Unknown=4, NotChecked=0, Total=2162 [2018-12-03 18:07:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 18:07:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 18:07:10,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 18:07:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 18:07:10,815 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-12-03 18:07:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:10,815 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 18:07:10,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 18:07:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 18:07:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 18:07:10,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:10,816 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 18:07:10,816 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:10,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 12 times [2018-12-03 18:07:10,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:10,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:10,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:10,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:10,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:11,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:11,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:11,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:11,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:11,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:11,430 INFO L192 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 [2018-12-03 18:07:11,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:07:11,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:07:11,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:07:11,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:07:11,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:11,593 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:11,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:26,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:26,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 18:07:26,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:26,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 18:07:26,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 18:07:26,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1874, Unknown=5, NotChecked=0, Total=2550 [2018-12-03 18:07:26,546 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 18:07:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:29,530 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-03 18:07:29,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 18:07:29,531 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 18:07:29,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:29,532 INFO L225 Difference]: With dead ends: 31 [2018-12-03 18:07:29,532 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 18:07:29,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=671, Invalid=1874, Unknown=5, NotChecked=0, Total=2550 [2018-12-03 18:07:29,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 18:07:29,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 18:07:29,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 18:07:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 18:07:29,539 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-12-03 18:07:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:29,539 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 18:07:29,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 18:07:29,540 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 18:07:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 18:07:29,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:29,541 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 18:07:29,541 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:29,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:29,541 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 13 times [2018-12-03 18:07:29,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:29,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:29,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:07:29,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:29,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 324 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:33,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:33,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:07:33,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:07:33,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:07:33,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:07:33,346 INFO L192 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 [2018-12-03 18:07:33,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:33,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:07:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:07:33,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:07:33,435 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 324 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:33,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:07:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:07:56,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:07:56,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 18:07:56,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:07:56,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 18:07:56,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 18:07:56,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=2185, Unknown=9, NotChecked=0, Total=2970 [2018-12-03 18:07:56,307 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 18:07:57,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:07:57,077 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 18:07:57,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 18:07:57,077 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 18:07:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:07:57,078 INFO L225 Difference]: With dead ends: 33 [2018-12-03 18:07:57,078 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 18:07:57,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=776, Invalid=2185, Unknown=9, NotChecked=0, Total=2970 [2018-12-03 18:07:57,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 18:07:57,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 18:07:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 18:07:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 18:07:57,085 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-12-03 18:07:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:07:57,085 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 18:07:57,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 18:07:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 18:07:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 18:07:57,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:07:57,087 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 18:07:57,087 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:07:57,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:07:57,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 14 times [2018-12-03 18:07:57,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:07:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:57,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:07:57,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:07:57,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:07:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:04,040 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:04,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:04,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:04,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:04,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:04,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:04,041 INFO L192 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 [2018-12-03 18:08:04,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:08:04,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:08:04,073 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 18:08:04,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:04,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:04,146 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:04,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:08:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:36,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:08:36,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 18:08:36,234 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:08:36,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 18:08:36,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 18:08:36,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=887, Invalid=2519, Unknown=16, NotChecked=0, Total=3422 [2018-12-03 18:08:36,236 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 18:08:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:08:37,666 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-03 18:08:37,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 18:08:37,667 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 18:08:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:08:37,668 INFO L225 Difference]: With dead ends: 35 [2018-12-03 18:08:37,668 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 18:08:37,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=887, Invalid=2519, Unknown=16, NotChecked=0, Total=3422 [2018-12-03 18:08:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 18:08:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 18:08:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 18:08:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 18:08:37,677 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-12-03 18:08:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:08:37,677 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 18:08:37,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 18:08:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 18:08:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 18:08:37,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:08:37,679 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 18:08:37,679 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:08:37,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:08:37,683 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 15 times [2018-12-03 18:08:37,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:08:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:37,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:08:37,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:08:37,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:08:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:08:41,041 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:41,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:41,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:08:41,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:08:41,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:08:41,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:08:41,042 INFO L192 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 [2018-12-03 18:08:41,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:08:41,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:08:41,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:08:41,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:08:41,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:08:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:08:41,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:09:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:09:05,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:09:05,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 18:09:05,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:09:05,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 18:09:05,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 18:09:05,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1016, Invalid=2881, Unknown=9, NotChecked=0, Total=3906 [2018-12-03 18:09:05,646 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-12-03 18:09:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:09:09,422 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-03 18:09:09,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 18:09:09,423 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-12-03 18:09:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:09:09,424 INFO L225 Difference]: With dead ends: 37 [2018-12-03 18:09:09,424 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 18:09:09,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=1016, Invalid=2881, Unknown=9, NotChecked=0, Total=3906 [2018-12-03 18:09:09,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 18:09:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 18:09:09,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 18:09:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 18:09:09,431 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-12-03 18:09:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:09:09,431 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 18:09:09,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 18:09:09,431 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 18:09:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 18:09:09,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:09:09,432 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 18:09:09,432 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:09:09,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:09:09,433 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 16 times [2018-12-03 18:09:09,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:09:09,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:09,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:09:09,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:09,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:09:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:09:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:09:12,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:09:12,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:09:12,830 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:09:12,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:09:12,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:09:12,830 INFO L192 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 [2018-12-03 18:09:12,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:09:12,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:09:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:09:12,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:09:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:09:12,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:09:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:09:49,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:09:49,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 18:09:49,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:09:49,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 18:09:49,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 18:09:49,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1142, Invalid=3265, Unknown=15, NotChecked=0, Total=4422 [2018-12-03 18:09:49,419 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-12-03 18:09:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:09:56,863 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 18:09:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 18:09:56,863 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-12-03 18:09:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:09:56,864 INFO L225 Difference]: With dead ends: 39 [2018-12-03 18:09:56,864 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 18:09:56,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=1142, Invalid=3265, Unknown=15, NotChecked=0, Total=4422 [2018-12-03 18:09:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 18:09:56,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 18:09:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 18:09:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 18:09:56,873 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-12-03 18:09:56,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:09:56,873 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 18:09:56,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 18:09:56,873 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 18:09:56,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 18:09:56,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:09:56,874 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 18:09:56,874 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:09:56,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:09:56,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 17 times [2018-12-03 18:09:56,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:09:56,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:56,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:09:56,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:09:56,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:09:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:10:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:10:02,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:10:02,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:10:02,085 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:10:02,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:10:02,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:10:02,085 INFO L192 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 [2018-12-03 18:10:02,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:10:02,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:10:02,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 18:10:02,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:10:02,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:10:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:10:03,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:10:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:10:47,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:10:47,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2018-12-03 18:10:47,598 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:10:47,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 18:10:47,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 18:10:47,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1279, Invalid=3672, Unknown=19, NotChecked=0, Total=4970 [2018-12-03 18:10:47,601 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-12-03 18:10:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:10:55,137 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-12-03 18:10:55,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 18:10:55,138 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-12-03 18:10:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:10:55,139 INFO L225 Difference]: With dead ends: 41 [2018-12-03 18:10:55,140 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 18:10:55,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=1279, Invalid=3672, Unknown=19, NotChecked=0, Total=4970 [2018-12-03 18:10:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 18:10:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 18:10:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 18:10:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 18:10:55,147 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-12-03 18:10:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:10:55,148 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 18:10:55,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 18:10:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 18:10:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 18:10:55,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:10:55,149 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 18:10:55,149 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:10:55,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:10:55,149 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 18 times [2018-12-03 18:10:55,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:10:55,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:10:55,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:10:55,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:10:55,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:10:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:10:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:10:56,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:10:56,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:10:56,594 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:10:56,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:10:56,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:10:56,594 INFO L192 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 [2018-12-03 18:10:56,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:10:56,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:10:56,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:10:56,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:10:56,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:10:56,869 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:10:56,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:11:38,367 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:38,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:11:38,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 74 [2018-12-03 18:11:38,386 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:11:38,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 18:11:38,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 18:11:38,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1428, Invalid=4106, Unknown=16, NotChecked=0, Total=5550 [2018-12-03 18:11:38,390 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-12-03 18:11:40,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:11:40,220 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-03 18:11:40,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 18:11:40,221 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-12-03 18:11:40,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:11:40,222 INFO L225 Difference]: With dead ends: 43 [2018-12-03 18:11:40,222 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 18:11:40,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=1428, Invalid=4106, Unknown=16, NotChecked=0, Total=5550 [2018-12-03 18:11:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 18:11:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 18:11:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 18:11:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 18:11:40,229 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-12-03 18:11:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:11:40,229 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 18:11:40,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 18:11:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 18:11:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 18:11:40,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:11:40,230 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 18:11:40,231 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:11:40,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:11:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 19 times [2018-12-03 18:11:40,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:11:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:11:40,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:11:40,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:11:40,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:11:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:11:44,137 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:44,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:11:44,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:11:44,138 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:11:44,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:11:44,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:11:44,138 INFO L192 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 [2018-12-03 18:11:44,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:11:44,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:11:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:11:44,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:11:44,447 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:11:44,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:12:36,479 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:12:36,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:12:36,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2018-12-03 18:12:36,499 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:12:36,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 18:12:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 18:12:36,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1580, Invalid=4561, Unknown=21, NotChecked=0, Total=6162 [2018-12-03 18:12:36,500 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-12-03 18:12:50,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:12:50,635 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 18:12:50,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 18:12:50,635 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-12-03 18:12:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:12:50,636 INFO L225 Difference]: With dead ends: 45 [2018-12-03 18:12:50,636 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 18:12:50,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=1580, Invalid=4561, Unknown=21, NotChecked=0, Total=6162 [2018-12-03 18:12:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 18:12:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 18:12:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 18:12:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 18:12:50,643 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-12-03 18:12:50,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:12:50,643 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 18:12:50,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 18:12:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 18:12:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 18:12:50,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:12:50,644 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 18:12:50,645 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:12:50,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:12:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 20 times [2018-12-03 18:12:50,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:12:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:12:50,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:12:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:12:50,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:12:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:12:56,531 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:12:56,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:12:56,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:12:56,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:12:56,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:12:56,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:12:56,532 INFO L192 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 [2018-12-03 18:12:56,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:12:56,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:12:56,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 18:12:56,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:12:56,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:12:56,722 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:12:56,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:13:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:13:45,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:13:45,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2018-12-03 18:13:45,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:13:45,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 18:13:45,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 18:13:45,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1746, Invalid=5040, Unknown=20, NotChecked=0, Total=6806 [2018-12-03 18:13:45,337 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-12-03 18:13:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:13:49,208 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-03 18:13:49,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 18:13:49,209 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-12-03 18:13:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:13:49,210 INFO L225 Difference]: With dead ends: 47 [2018-12-03 18:13:49,210 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 18:13:49,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 54.5s TimeCoverageRelationStatistics Valid=1746, Invalid=5040, Unknown=20, NotChecked=0, Total=6806 [2018-12-03 18:13:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 18:13:49,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 18:13:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 18:13:49,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 18:13:49,217 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-12-03 18:13:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:13:49,218 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 18:13:49,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 18:13:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 18:13:49,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 18:13:49,219 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:13:49,219 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 18:13:49,219 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:13:49,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:13:49,219 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 21 times [2018-12-03 18:13:49,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:13:49,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:13:49,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:13:49,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:13:49,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:13:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:13:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 860 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:13:57,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:13:57,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:13:57,566 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:13:57,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:13:57,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:13:57,567 INFO L192 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 [2018-12-03 18:13:57,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:13:57,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:13:57,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:13:57,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:13:57,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:13:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 860 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:13:57,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:14:45,476 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:14:45,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:14:45,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 86 [2018-12-03 18:14:45,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:14:45,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 18:14:45,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 18:14:45,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1919, Invalid=5543, Unknown=20, NotChecked=0, Total=7482 [2018-12-03 18:14:45,499 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-12-03 18:15:05,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:15:05,323 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-03 18:15:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 18:15:05,325 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-12-03 18:15:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:15:05,326 INFO L225 Difference]: With dead ends: 49 [2018-12-03 18:15:05,327 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 18:15:05,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 56.1s TimeCoverageRelationStatistics Valid=1919, Invalid=5543, Unknown=20, NotChecked=0, Total=7482 [2018-12-03 18:15:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 18:15:05,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 18:15:05,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 18:15:05,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 18:15:05,334 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-12-03 18:15:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:15:05,334 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 18:15:05,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 18:15:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 18:15:05,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 18:15:05,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:15:05,335 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 18:15:05,335 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:15:05,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:15:05,337 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 22 times [2018-12-03 18:15:05,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:15:05,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:15:05,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:15:05,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:15:05,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:15:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:15:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:15:09,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:15:09,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:15:09,519 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:15:09,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:15:09,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:15:09,520 INFO L192 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 [2018-12-03 18:15:09,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:15:09,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:15:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:15:09,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:15:11,720 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:15:11,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:16:34,789 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:34,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:16:34,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 90 [2018-12-03 18:16:34,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:16:34,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 18:16:34,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 18:16:34,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=6072, Unknown=35, NotChecked=0, Total=8190 [2018-12-03 18:16:34,811 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-12-03 18:16:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:16:41,320 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 18:16:41,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 18:16:41,321 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-12-03 18:16:41,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:16:41,322 INFO L225 Difference]: With dead ends: 51 [2018-12-03 18:16:41,322 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 18:16:41,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 89.3s TimeCoverageRelationStatistics Valid=2083, Invalid=6072, Unknown=35, NotChecked=0, Total=8190 [2018-12-03 18:16:41,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 18:16:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 18:16:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 18:16:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 18:16:41,329 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-12-03 18:16:41,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:16:41,329 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 18:16:41,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 18:16:41,329 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 18:16:41,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 18:16:41,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:16:41,330 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 18:16:41,330 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:16:41,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:16:41,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 23 times [2018-12-03 18:16:41,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:16:41,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:41,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:16:41,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:16:41,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:16:41,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:16:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:56,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:56,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:16:56,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:16:56,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:16:56,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:16:56,186 INFO L192 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 [2018-12-03 18:16:56,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 18:16:56,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 18:16:56,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 18:16:56,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:16:56,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:16:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:16:56,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:18:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:06,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:18:06,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2018-12-03 18:18:06,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:18:06,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 18:18:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 18:18:06,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2279, Invalid=6620, Unknown=31, NotChecked=0, Total=8930 [2018-12-03 18:18:06,315 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-12-03 18:18:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:18:40,893 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-12-03 18:18:40,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 18:18:40,893 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-12-03 18:18:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:18:40,894 INFO L225 Difference]: With dead ends: 53 [2018-12-03 18:18:40,894 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 18:18:40,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 84.8s TimeCoverageRelationStatistics Valid=2279, Invalid=6620, Unknown=31, NotChecked=0, Total=8930 [2018-12-03 18:18:40,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 18:18:40,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 18:18:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 18:18:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 18:18:40,902 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-12-03 18:18:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:18:40,902 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 18:18:40,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 18:18:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 18:18:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 18:18:40,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:18:40,903 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 18:18:40,903 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:18:40,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:18:40,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 24 times [2018-12-03 18:18:40,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:18:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:40,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:18:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:18:40,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:18:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:18:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1127 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:18:59,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:59,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:18:59,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:18:59,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:18:59,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:18:59,941 INFO L192 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 [2018-12-03 18:18:59,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 18:18:59,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 18:18:59,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 18:18:59,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 18:18:59,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:19:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1127 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:19:00,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 18:20:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:13,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 18:20:13,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 98 [2018-12-03 18:20:13,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 18:20:13,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 18:20:13,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 18:20:13,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2473, Invalid=7195, Unknown=34, NotChecked=0, Total=9702 [2018-12-03 18:20:13,709 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-12-03 18:20:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 18:20:16,131 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-03 18:20:16,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 18:20:16,132 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-12-03 18:20:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 18:20:16,132 INFO L225 Difference]: With dead ends: 55 [2018-12-03 18:20:16,132 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 18:20:16,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 92.6s TimeCoverageRelationStatistics Valid=2473, Invalid=7195, Unknown=34, NotChecked=0, Total=9702 [2018-12-03 18:20:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 18:20:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 18:20:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 18:20:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 18:20:16,140 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-12-03 18:20:16,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 18:20:16,140 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 18:20:16,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 18:20:16,140 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 18:20:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 18:20:16,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 18:20:16,141 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 18:20:16,141 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 18:20:16,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 18:20:16,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 25 times [2018-12-03 18:20:16,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 18:20:16,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:16,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 18:20:16,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 18:20:16,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 18:20:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1224 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:29,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:29,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 18:20:29,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 18:20:29,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 18:20:29,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 18:20:29,025 INFO L192 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 [2018-12-03 18:20:29,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 18:20:29,036 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 18:20:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 18:20:29,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 18:20:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1224 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 18:20:29,286 INFO L316 TraceCheckSpWp]: Computing backward predicates...