java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:49:35,383 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:49:35,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:49:35,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:49:35,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:49:35,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:49:35,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:49:35,401 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:49:35,403 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:49:35,403 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:49:35,404 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:49:35,405 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:49:35,406 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:49:35,407 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:49:35,408 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:49:35,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:49:35,409 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:49:35,411 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:49:35,413 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:49:35,415 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:49:35,416 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:49:35,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:49:35,420 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:49:35,420 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:49:35,420 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:49:35,421 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:49:35,422 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:49:35,423 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:49:35,424 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:49:35,425 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:49:35,425 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:49:35,426 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:49:35,426 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:49:35,427 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:49:35,428 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:49:35,428 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:49:35,429 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:49:35,441 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:49:35,442 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:49:35,442 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:49:35,443 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:49:35,443 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:49:35,443 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:49:35,443 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:49:35,444 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:49:35,444 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:49:35,444 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:49:35,444 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:49:35,444 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:49:35,445 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:49:35,445 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:49:35,445 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:49:35,446 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:49:35,446 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:49:35,446 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:49:35,447 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:49:35,447 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:49:35,447 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:49:35,447 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:49:35,447 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:49:35,448 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:49:35,448 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:49:35,448 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:49:35,448 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:49:35,448 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:49:35,449 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:49:35,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:49:35,449 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:49:35,449 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:49:35,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:49:35,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:49:35,450 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:49:35,450 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:49:35,450 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:49:35,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:49:35,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:49:35,451 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:49:35,451 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:49:35,495 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:49:35,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:49:35,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:49:35,523 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:49:35,524 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:49:35,525 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl [2018-12-03 15:49:35,525 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl' [2018-12-03 15:49:35,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:49:35,566 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:49:35,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:49:35,568 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:49:35,568 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:49:35,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/1) ... [2018-12-03 15:49:35,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/1) ... [2018-12-03 15:49:35,602 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:49:35,602 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:49:35,603 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:49:35,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:49:35,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:49:35,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:49:35,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:49:35,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/1) ... [2018-12-03 15:49:35,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/1) ... [2018-12-03 15:49:35,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/1) ... [2018-12-03 15:49:35,619 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/1) ... [2018-12-03 15:49:35,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/1) ... [2018-12-03 15:49:35,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/1) ... [2018-12-03 15:49:35,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/1) ... [2018-12-03 15:49:35,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:49:35,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:49:35,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:49:35,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:49:35,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (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 15:49:35,705 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 15:49:35,705 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:49:35,706 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:49:35,985 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:49:35,986 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:49:35,986 INFO L202 PluginConnector]: Adding new model Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:49:35 BoogieIcfgContainer [2018-12-03 15:49:35,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:49:35,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:49:35,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:49:35,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:49:35,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:35" (1/2) ... [2018-12-03 15:49:35,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ad7e7e and model type Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:49:35, skipping insertion in model container [2018-12-03 15:49:35,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:49:35" (2/2) ... [2018-12-03 15:49:35,994 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-ArraysIntegefied.bpl [2018-12-03 15:49:36,004 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:49:36,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:49:36,031 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:49:36,065 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:49:36,065 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:49:36,065 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:49:36,065 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:49:36,066 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:49:36,066 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:49:36,066 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:49:36,066 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:49:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-12-03 15:49:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:49:36,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:36,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:49:36,091 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:36,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:36,097 INFO L82 PathProgramCache]: Analyzing trace with hash 890493448, now seen corresponding path program 1 times [2018-12-03 15:49:36,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:36,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:36,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,268 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 15:49:36,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:49:36,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:49:36,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:49:36,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:49:36,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:49:36,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:49:36,299 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2018-12-03 15:49:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:36,415 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2018-12-03 15:49:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:49:36,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-12-03 15:49:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:36,432 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:49:36,436 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:49:36,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:49:36,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:49:36,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:49:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:49:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:49:36,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2018-12-03 15:49:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:36,480 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:49:36,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:49:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:49:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:49:36,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:36,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:49:36,482 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:36,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:36,482 INFO L82 PathProgramCache]: Analyzing trace with hash 892342412, now seen corresponding path program 1 times [2018-12-03 15:49:36,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:36,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,544 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 15:49:36,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:49:36,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:49:36,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:49:36,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:49:36,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:49:36,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:49:36,547 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 3 states. [2018-12-03 15:49:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:36,587 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:49:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:49:36,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2018-12-03 15:49:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:36,589 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:49:36,589 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:49:36,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 15:49:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:49:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:49:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:49:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:49:36,594 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 6 [2018-12-03 15:49:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:36,594 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:49:36,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:49:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:49:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:49:36,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:36,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:36,595 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:36,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash -391235530, now seen corresponding path program 1 times [2018-12-03 15:49:36,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:36,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:36,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,653 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 15:49:36,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:36,655 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 15:49:36,657 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [16], [21], [23], [28], [33], [34] [2018-12-03 15:49:36,696 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:49:36,697 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:49:36,856 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:49:36,857 INFO L272 AbstractInterpreter]: Visited 10 different actions 25 times. Merged at 5 different actions 12 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:49:36,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:36,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:49:36,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,886 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 15:49:36,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:36,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:36,937 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 15:49:36,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:36,987 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 15:49:37,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:37,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:49:37,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:37,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:49:37,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:49:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:49:37,015 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2018-12-03 15:49:37,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:37,032 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:49:37,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:49:37,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-12-03 15:49:37,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:37,035 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:49:37,035 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:49:37,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:49:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:49:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:49:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:49:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 15:49:37,039 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2018-12-03 15:49:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:37,040 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 15:49:37,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:49:37,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 15:49:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:49:37,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:37,041 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:37,041 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:37,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash -602113312, now seen corresponding path program 2 times [2018-12-03 15:49:37,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:37,136 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 15:49:37,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:37,137 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:37,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:37,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,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 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 15:49:37,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:37,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:37,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:49:37,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:37,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:37,171 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 15:49:37,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:37,288 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 15:49:37,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:37,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:49:37,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:37,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:49:37,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:49:37,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:49:37,315 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-12-03 15:49:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:37,407 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:49:37,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:49:37,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-03 15:49:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:37,408 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:49:37,408 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:49:37,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:49:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:49:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:49:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:49:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 15:49:37,413 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-12-03 15:49:37,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:37,413 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 15:49:37,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:49:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 15:49:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:49:37,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:37,414 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:37,415 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:37,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:37,415 INFO L82 PathProgramCache]: Analyzing trace with hash 334846090, now seen corresponding path program 3 times [2018-12-03 15:49:37,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:37,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:37,586 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 15:49:37,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:37,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:37,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:37,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,588 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 15:49:37,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:37,605 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:37,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:37,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:37,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:37,639 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 15:49:37,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:37,758 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 15:49:37,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:37,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:49:37,778 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:37,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:49:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:49:37,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:49:37,780 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 6 states. [2018-12-03 15:49:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:37,815 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:49:37,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:49:37,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-03 15:49:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:37,818 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:49:37,818 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:49:37,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:49:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:49:37,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:49:37,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:49:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 15:49:37,822 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2018-12-03 15:49:37,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:37,822 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 15:49:37,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:49:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 15:49:37,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:49:37,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:37,824 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:37,824 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:37,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:37,825 INFO L82 PathProgramCache]: Analyzing trace with hash -747417292, now seen corresponding path program 4 times [2018-12-03 15:49:37,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:37,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:37,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:38,032 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 15:49:38,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:38,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:38,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:38,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:38,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:38,034 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 15:49:38,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:38,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:38,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:38,078 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 15:49:38,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:38,180 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 15:49:38,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:38,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:49:38,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:38,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:49:38,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:49:38,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:49:38,202 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 7 states. [2018-12-03 15:49:38,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:38,222 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:49:38,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:49:38,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-12-03 15:49:38,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:38,224 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:49:38,224 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:49:38,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:49:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:49:38,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:49:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:49:38,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 15:49:38,229 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-12-03 15:49:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:38,229 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 15:49:38,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:49:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 15:49:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:49:38,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:38,231 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:38,231 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:38,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:38,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1016128734, now seen corresponding path program 5 times [2018-12-03 15:49:38,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:38,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:38,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:38,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:38,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:38,515 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 15:49:38,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:38,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:38,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:38,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:38,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:38,517 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 15:49:38,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:38,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:38,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:49:38,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:38,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:38,626 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 15:49:38,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:38,804 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 15:49:38,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:38,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:49:38,823 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:38,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:49:38,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:49:38,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:49:38,824 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 8 states. [2018-12-03 15:49:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:38,861 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:49:38,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:49:38,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-12-03 15:49:38,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:38,862 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:49:38,862 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:49:38,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:49:38,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:49:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:49:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:49:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 15:49:38,867 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 26 [2018-12-03 15:49:38,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:38,868 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 15:49:38,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:49:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 15:49:38,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:49:38,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:38,869 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:38,869 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:38,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:38,869 INFO L82 PathProgramCache]: Analyzing trace with hash -267873400, now seen corresponding path program 6 times [2018-12-03 15:49:38,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:38,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:38,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:38,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:38,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:38,992 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 15:49:38,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:38,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:38,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:38,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:38,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:38,993 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 15:49:39,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:39,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:39,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:39,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:39,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:39,050 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 15:49:39,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:39,247 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 15:49:39,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:39,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:49:39,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:39,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:49:39,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:49:39,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:49:39,268 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2018-12-03 15:49:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:39,308 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 15:49:39,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:49:39,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-12-03 15:49:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:39,310 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:49:39,310 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:49:39,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:49:39,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:49:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:49:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:49:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 15:49:39,315 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2018-12-03 15:49:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:39,315 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 15:49:39,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:49:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 15:49:39,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:49:39,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:39,316 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:39,316 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:39,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:39,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1386947278, now seen corresponding path program 7 times [2018-12-03 15:49:39,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:39,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:39,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:39,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:39,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:39,475 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 15:49:39,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:39,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:39,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:39,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:39,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:39,476 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 15:49:39,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:39,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:39,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:39,507 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 15:49:39,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:39,784 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 15:49:39,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:39,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:49:39,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:39,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:49:39,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:49:39,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:49:39,805 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 10 states. [2018-12-03 15:49:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:39,915 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 15:49:39,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:49:39,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-12-03 15:49:39,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:39,916 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:49:39,916 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:49:39,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:49:39,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:49:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 15:49:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:49:39,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 15:49:39,922 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 34 [2018-12-03 15:49:39,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:39,922 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 15:49:39,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:49:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 15:49:39,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:49:39,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:39,923 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:39,924 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:39,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash -223329828, now seen corresponding path program 8 times [2018-12-03 15:49:39,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:39,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:39,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:39,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:39,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:40,055 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 15:49:40,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:40,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:40,056 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:40,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:40,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:40,057 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 15:49:40,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:40,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:40,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 15:49:40,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:40,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:40,208 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 15:49:40,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:40,507 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 15:49:40,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:40,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:49:40,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:40,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:49:40,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:49:40,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:49:40,528 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 11 states. [2018-12-03 15:49:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:40,560 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 15:49:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:49:40,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-12-03 15:49:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:40,562 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:49:40,562 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:49:40,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:49:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:49:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:49:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:49:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 15:49:40,567 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 38 [2018-12-03 15:49:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:40,567 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 15:49:40,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:49:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 15:49:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:49:40,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:40,569 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:40,569 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:40,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:40,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1659551354, now seen corresponding path program 9 times [2018-12-03 15:49:40,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:40,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:40,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:40,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:40,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:40,694 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 15:49:40,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:40,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:40,695 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:40,695 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:40,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:40,696 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 15:49:40,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:40,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:40,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:40,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:40,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:40,751 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 15:49:40,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:40,992 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 15:49:41,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:41,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:49:41,011 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:41,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:49:41,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:49:41,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:49:41,014 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 12 states. [2018-12-03 15:49:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:41,133 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 15:49:41,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:49:41,134 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-12-03 15:49:41,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:41,134 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:49:41,134 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:49:41,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:49:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:49:41,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:49:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:49:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 15:49:41,139 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 42 [2018-12-03 15:49:41,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:41,140 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 15:49:41,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:49:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 15:49:41,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:49:41,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:41,141 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:41,141 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:41,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:41,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2009179088, now seen corresponding path program 10 times [2018-12-03 15:49:41,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:41,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:41,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:41,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:41,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:41,427 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 15:49:41,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:41,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:41,428 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:41,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:41,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:41,428 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 15:49:41,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:41,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:41,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:41,464 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 15:49:41,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:41,697 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 15:49:41,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:41,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:49:41,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:41,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:49:41,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:49:41,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:49:41,719 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 13 states. [2018-12-03 15:49:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:41,744 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 15:49:41,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:49:41,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-12-03 15:49:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:41,750 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:49:41,751 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:49:41,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:49:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:49:41,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:49:41,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:49:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 15:49:41,756 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2018-12-03 15:49:41,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:41,756 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 15:49:41,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:49:41,756 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 15:49:41,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:49:41,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:41,757 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:41,758 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:41,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:41,758 INFO L82 PathProgramCache]: Analyzing trace with hash 782635482, now seen corresponding path program 11 times [2018-12-03 15:49:41,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:41,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:41,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:41,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:41,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:42,025 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 15:49:42,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:42,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:42,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:42,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:42,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:42,026 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 15:49:42,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:42,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:42,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:49:42,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:42,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:42,093 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 15:49:42,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:42,489 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 15:49:42,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:42,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 15:49:42,508 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:42,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:49:42,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:49:42,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:49:42,509 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 14 states. [2018-12-03 15:49:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:42,545 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 15:49:42,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:49:42,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-12-03 15:49:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:42,546 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:49:42,546 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:49:42,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:49:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:49:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:49:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:49:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 15:49:42,552 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 50 [2018-12-03 15:49:42,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:42,552 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 15:49:42,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:49:42,552 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 15:49:42,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:49:42,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:42,554 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:42,554 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:42,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:42,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1233576580, now seen corresponding path program 12 times [2018-12-03 15:49:42,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:42,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:42,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:42,737 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 15:49:42,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:42,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:42,737 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:42,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:42,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:42,738 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 15:49:42,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:42,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:42,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:42,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:42,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:42,777 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 15:49:42,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:43,192 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 15:49:43,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:43,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:49:43,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:43,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:49:43,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:49:43,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:49:43,213 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 15 states. [2018-12-03 15:49:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:43,243 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 15:49:43,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:49:43,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 54 [2018-12-03 15:49:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:43,244 INFO L225 Difference]: With dead ends: 61 [2018-12-03 15:49:43,245 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:49:43,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:49:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:49:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:49:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:49:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 15:49:43,249 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 54 [2018-12-03 15:49:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:43,250 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 15:49:43,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:49:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 15:49:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:49:43,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:43,251 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:43,251 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:43,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:43,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1893420590, now seen corresponding path program 13 times [2018-12-03 15:49:43,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:43,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:43,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:43,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:43,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:43,429 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 15:49:43,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:43,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:43,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:43,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:43,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:43,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 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 15:49:43,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:43,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:43,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:43,484 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 15:49:43,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:44,339 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 15:49:44,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:44,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:49:44,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:44,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:49:44,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:49:44,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:49:44,360 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 16 states. [2018-12-03 15:49:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:44,386 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 15:49:44,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:49:44,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-12-03 15:49:44,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:44,387 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:49:44,387 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:49:44,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:49:44,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:49:44,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 15:49:44,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:49:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 15:49:44,394 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 58 [2018-12-03 15:49:44,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:44,394 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 15:49:44,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:49:44,395 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 15:49:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:49:44,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:44,396 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:44,396 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:44,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1151478568, now seen corresponding path program 14 times [2018-12-03 15:49:44,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:44,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:44,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:44,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:44,613 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 15:49:44,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:44,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:44,613 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:44,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:44,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:44,614 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 15:49:44,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:44,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:44,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 15:49:44,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:44,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:44,662 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 15:49:44,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:46,780 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 15:49:46,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:46,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 15:49:46,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:46,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:49:46,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:49:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:49:46,800 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 17 states. [2018-12-03 15:49:46,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:46,839 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 15:49:46,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:49:46,839 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2018-12-03 15:49:46,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:46,839 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:49:46,840 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:49:46,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:49:46,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:49:46,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:49:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:49:46,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 15:49:46,844 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 62 [2018-12-03 15:49:46,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:46,845 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 15:49:46,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:49:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 15:49:46,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:49:46,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:46,846 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:46,846 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:46,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:46,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1586034306, now seen corresponding path program 15 times [2018-12-03 15:49:46,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:46,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:46,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:46,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:46,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:47,797 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 15:49:47,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:47,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:47,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:47,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:47,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:47,798 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 15:49:47,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:47,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:47,821 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:47,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:47,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:47,842 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 15:49:47,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:48,381 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 15:49:48,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:48,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:49:48,400 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:48,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:49:48,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:49:48,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:49:48,401 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 18 states. [2018-12-03 15:49:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:48,434 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 15:49:48,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:49:48,434 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 66 [2018-12-03 15:49:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:48,435 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:49:48,435 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 15:49:48,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:49:48,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 15:49:48,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 15:49:48,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 15:49:48,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 15:49:48,443 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 66 [2018-12-03 15:49:48,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:48,443 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 15:49:48,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:49:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 15:49:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 15:49:48,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:48,445 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:48,445 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:48,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1318531884, now seen corresponding path program 16 times [2018-12-03 15:49:48,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:48,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:48,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:49,177 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 15:49:49,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:49,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:49,178 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:49,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:49,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:49,178 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 15:49:49,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:49,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:49,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:49,233 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 15:49:49,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:50,128 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 15:49:50,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:50,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:49:50,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:50,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:49:50,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:49:50,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:49:50,154 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 19 states. [2018-12-03 15:49:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:50,279 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 15:49:50,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:49:50,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-12-03 15:49:50,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:50,280 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:49:50,280 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:49:50,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:49:50,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:49:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 15:49:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:49:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 15:49:50,284 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 70 [2018-12-03 15:49:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:50,284 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 15:49:50,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:49:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 15:49:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:49:50,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:50,288 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:50,288 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:50,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:50,288 INFO L82 PathProgramCache]: Analyzing trace with hash -561837354, now seen corresponding path program 17 times [2018-12-03 15:49:50,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:50,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:50,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:50,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:50,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:50,548 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 15:49:50,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:50,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:50,549 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:50,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:50,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:50,549 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 15:49:50,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:50,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:50,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:49:50,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:50,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:50,596 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 15:49:50,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:51,424 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 15:49:51,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:51,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 15:49:51,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:51,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:49:51,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:49:51,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:49:51,445 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 20 states. [2018-12-03 15:49:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:51,541 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 15:49:51,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:49:51,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-12-03 15:49:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:51,542 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:49:51,542 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:49:51,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:49:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:49:51,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 15:49:51,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 15:49:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 15:49:51,547 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 74 [2018-12-03 15:49:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:51,547 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 15:49:51,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:49:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 15:49:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:49:51,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:51,549 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:51,549 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:51,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:51,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1611070848, now seen corresponding path program 18 times [2018-12-03 15:49:51,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:51,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:51,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:51,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:52,257 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 15:49:52,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:52,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:52,257 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:52,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:52,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:52,258 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 15:49:52,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:52,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:52,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:52,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:52,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:52,301 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 15:49:52,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:53,046 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 15:49:53,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:53,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:49:53,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:53,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:49:53,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:49:53,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:49:53,066 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 21 states. [2018-12-03 15:49:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:53,097 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 15:49:53,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:49:53,098 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 78 [2018-12-03 15:49:53,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:53,099 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:49:53,099 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:49:53,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:49:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:49:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 15:49:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 15:49:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 15:49:53,106 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 78 [2018-12-03 15:49:53,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:53,106 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 15:49:53,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:49:53,106 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 15:49:53,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 15:49:53,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:53,108 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:53,108 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:53,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:53,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1013085398, now seen corresponding path program 19 times [2018-12-03 15:49:53,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:53,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:53,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:53,427 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 15:49:53,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:53,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:53,428 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:53,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:53,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:53,428 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 15:49:53,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:53,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:53,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:53,468 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 15:49:53,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:54,132 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 15:49:54,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:54,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:49:54,151 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:54,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:49:54,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:49:54,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:49:54,152 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 22 states. [2018-12-03 15:49:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:54,199 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 15:49:54,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:49:54,199 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 82 [2018-12-03 15:49:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:54,200 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:49:54,200 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 15:49:54,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:49:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 15:49:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 15:49:54,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:49:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 15:49:54,205 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 82 [2018-12-03 15:49:54,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:54,206 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 15:49:54,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:49:54,206 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 15:49:54,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:49:54,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:54,207 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:54,207 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:54,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:54,208 INFO L82 PathProgramCache]: Analyzing trace with hash 947991508, now seen corresponding path program 20 times [2018-12-03 15:49:54,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:54,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:54,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:54,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:54,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:54,652 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 15:49:54,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:54,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:54,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:54,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:54,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:54,653 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 15:49:54,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:54,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:54,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 15:49:54,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:54,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:54,701 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 15:49:54,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:55,239 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 15:49:55,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:55,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 15:49:55,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:55,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:49:55,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:49:55,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:49:55,259 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 23 states. [2018-12-03 15:49:55,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:55,320 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 15:49:55,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:49:55,323 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 86 [2018-12-03 15:49:55,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:55,324 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:49:55,324 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:49:55,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:49:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:49:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 15:49:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:49:55,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 15:49:55,327 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 86 [2018-12-03 15:49:55,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:55,328 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 15:49:55,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:49:55,328 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 15:49:55,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:49:55,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:55,329 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:55,329 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:55,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:55,330 INFO L82 PathProgramCache]: Analyzing trace with hash -861112450, now seen corresponding path program 21 times [2018-12-03 15:49:55,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:55,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:55,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:55,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:55,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:55,763 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 15:49:55,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:55,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:55,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:55,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:55,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:55,764 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 15:49:55,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:55,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:55,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:55,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:55,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:55,803 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 15:49:55,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:56,341 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 15:49:56,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:56,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:49:56,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:56,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:49:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:49:56,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:49:56,361 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 24 states. [2018-12-03 15:49:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:56,424 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 15:49:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:49:56,425 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 90 [2018-12-03 15:49:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:56,426 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:49:56,426 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 15:49:56,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:49:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 15:49:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 15:49:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 15:49:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 15:49:56,430 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 90 [2018-12-03 15:49:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:56,430 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 15:49:56,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:49:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 15:49:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 15:49:56,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:56,431 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:56,432 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:56,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash 215602728, now seen corresponding path program 22 times [2018-12-03 15:49:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:56,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:56,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:56,748 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 15:49:56,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:56,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:56,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:56,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:56,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:56,749 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 15:49:56,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:56,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:56,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:56,792 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 15:49:56,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:57,711 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 15:49:57,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:57,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:49:57,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:57,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:49:57,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:49:57,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:49:57,734 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 25 states. [2018-12-03 15:49:57,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:57,779 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 15:49:57,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:49:57,779 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 94 [2018-12-03 15:49:57,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:57,781 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:49:57,781 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:49:57,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:49:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:49:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 15:49:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 15:49:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 15:49:57,785 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 94 [2018-12-03 15:49:57,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:57,786 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 15:49:57,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:49:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 15:49:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:49:57,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:57,787 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:57,787 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:57,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:57,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1534865454, now seen corresponding path program 23 times [2018-12-03 15:49:57,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:57,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:57,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:57,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:57,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:58,107 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 15:49:58,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:58,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:58,108 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:58,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:58,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:58,108 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 15:49:58,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:58,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:58,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:49:58,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:58,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:58,164 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 15:49:58,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:58,823 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 15:49:58,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:58,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 15:49:58,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:58,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:49:58,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:49:58,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:49:58,844 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 26 states. [2018-12-03 15:49:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:59,038 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 15:49:59,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:49:59,040 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 98 [2018-12-03 15:49:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:59,040 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:49:59,040 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:49:59,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:49:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:49:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 15:49:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 15:49:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 15:49:59,044 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 98 [2018-12-03 15:49:59,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:59,044 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 15:49:59,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:49:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 15:49:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:49:59,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:59,045 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1] [2018-12-03 15:49:59,045 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:59,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:59,046 INFO L82 PathProgramCache]: Analyzing trace with hash -35330948, now seen corresponding path program 24 times [2018-12-03 15:49:59,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:59,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:59,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:59,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:59,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:59,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:59,512 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 15:49:59,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:59,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:59,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:59,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:59,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:59,512 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 15:49:59,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:59,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:59,540 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:59,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:59,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:59,559 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 15:49:59,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:00,434 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 15:50:00,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:00,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:50:00,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:00,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:50:00,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:50:00,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:50:00,455 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 27 states. [2018-12-03 15:50:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:00,505 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 15:50:00,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:50:00,506 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 102 [2018-12-03 15:50:00,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:00,507 INFO L225 Difference]: With dead ends: 109 [2018-12-03 15:50:00,507 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 15:50:00,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:50:00,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 15:50:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 15:50:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 15:50:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 15:50:00,512 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 102 [2018-12-03 15:50:00,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:00,512 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 15:50:00,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:50:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 15:50:00,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 15:50:00,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:00,513 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:00,513 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:00,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:00,514 INFO L82 PathProgramCache]: Analyzing trace with hash -503868378, now seen corresponding path program 25 times [2018-12-03 15:50:00,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:00,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:00,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:00,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:00,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:00,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:00,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:00,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:00,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:00,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:00,864 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 15:50:00,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:00,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:00,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:00,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:02,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:02,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 15:50:02,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:02,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:50:02,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:50:02,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:50:02,198 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 28 states. [2018-12-03 15:50:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:02,239 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 15:50:02,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:50:02,244 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 106 [2018-12-03 15:50:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:02,245 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:50:02,245 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 15:50:02,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:50:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 15:50:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 15:50:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 15:50:02,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 15:50:02,250 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 106 [2018-12-03 15:50:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:02,250 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 15:50:02,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:50:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 15:50:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 15:50:02,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:02,251 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:02,251 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:02,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:02,251 INFO L82 PathProgramCache]: Analyzing trace with hash 410410704, now seen corresponding path program 26 times [2018-12-03 15:50:02,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:02,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:02,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:02,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:02,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:02,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:02,779 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:02,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:02,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:02,779 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:02,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:02,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:02,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 15:50:02,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:02,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:02,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:03,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:03,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 15:50:03,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:03,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:50:03,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:50:03,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:50:03,648 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 29 states. [2018-12-03 15:50:03,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:03,783 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 15:50:03,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:50:03,783 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 110 [2018-12-03 15:50:03,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:03,785 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:50:03,785 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:50:03,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:50:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:50:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 15:50:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:50:03,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 15:50:03,791 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 110 [2018-12-03 15:50:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:03,792 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 15:50:03,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:50:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 15:50:03,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:50:03,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:03,793 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:03,793 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:03,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:03,793 INFO L82 PathProgramCache]: Analyzing trace with hash 131843194, now seen corresponding path program 27 times [2018-12-03 15:50:03,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:03,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:03,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:03,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:04,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:04,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:04,754 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:04,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:04,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:04,755 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:04,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:04,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:04,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:04,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:04,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:04,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:05,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:05,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 15:50:05,691 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:05,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:50:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:50:05,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:50:05,693 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 30 states. [2018-12-03 15:50:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:05,739 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-12-03 15:50:05,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:50:05,739 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 114 [2018-12-03 15:50:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:05,741 INFO L225 Difference]: With dead ends: 121 [2018-12-03 15:50:05,741 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 15:50:05,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:50:05,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 15:50:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 15:50:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 15:50:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-12-03 15:50:05,745 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 114 [2018-12-03 15:50:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:05,745 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-12-03 15:50:05,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:50:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-12-03 15:50:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 15:50:05,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:05,746 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:05,747 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:05,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:05,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1432503588, now seen corresponding path program 28 times [2018-12-03 15:50:05,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:05,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:05,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:05,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:06,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:06,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:06,154 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:06,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:06,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:06,155 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:06,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:06,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:06,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:06,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:07,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:07,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 15:50:07,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:07,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:50:07,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:50:07,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:50:07,351 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 31 states. [2018-12-03 15:50:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:07,435 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-12-03 15:50:07,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:50:07,435 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 118 [2018-12-03 15:50:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:07,437 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:50:07,437 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 15:50:07,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:50:07,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 15:50:07,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 15:50:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 15:50:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-12-03 15:50:07,441 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 118 [2018-12-03 15:50:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:07,442 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-12-03 15:50:07,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:50:07,442 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-12-03 15:50:07,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 15:50:07,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:07,443 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:07,443 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:07,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:07,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2063310642, now seen corresponding path program 29 times [2018-12-03 15:50:07,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:07,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:07,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:07,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:07,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:07,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:07,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:07,849 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:07,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:07,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:07,850 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:07,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:07,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:07,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 15:50:07,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:07,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:07,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:08,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:08,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 15:50:08,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:08,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:50:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:50:08,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:50:08,924 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 32 states. [2018-12-03 15:50:08,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:08,981 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-12-03 15:50:08,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:50:08,981 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 122 [2018-12-03 15:50:08,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:08,982 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:50:08,982 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:50:08,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:50:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:50:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 15:50:08,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 15:50:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-12-03 15:50:08,987 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 122 [2018-12-03 15:50:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:08,987 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-12-03 15:50:08,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:50:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-12-03 15:50:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 15:50:08,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:08,988 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:08,989 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:08,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:08,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1719888008, now seen corresponding path program 30 times [2018-12-03 15:50:08,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:08,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:08,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:08,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:08,990 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:09,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:09,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:09,782 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:09,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:09,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:09,782 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:09,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:09,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:09,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:09,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:09,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:09,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:10,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:10,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 15:50:10,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:10,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:50:10,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:50:10,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:50:10,962 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 33 states. [2018-12-03 15:50:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:11,020 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-12-03 15:50:11,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:50:11,020 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 126 [2018-12-03 15:50:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:11,022 INFO L225 Difference]: With dead ends: 133 [2018-12-03 15:50:11,022 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 15:50:11,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:50:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 15:50:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 15:50:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 15:50:11,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-12-03 15:50:11,025 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 126 [2018-12-03 15:50:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:11,026 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-12-03 15:50:11,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:50:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-12-03 15:50:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 15:50:11,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:11,027 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:11,027 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:11,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1270519518, now seen corresponding path program 31 times [2018-12-03 15:50:11,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:11,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:11,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:11,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:11,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:11,727 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:11,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:11,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:11,727 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:11,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:11,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:11,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:11,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:12,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:12,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 15:50:12,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:12,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:50:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:50:12,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:50:12,981 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 34 states. [2018-12-03 15:50:13,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:13,057 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-12-03 15:50:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:50:13,057 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 130 [2018-12-03 15:50:13,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:13,059 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:50:13,059 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:50:13,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:50:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:50:13,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 15:50:13,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 15:50:13,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-12-03 15:50:13,063 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 130 [2018-12-03 15:50:13,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:13,063 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-12-03 15:50:13,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:50:13,064 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-12-03 15:50:13,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 15:50:13,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:13,064 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:13,065 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:13,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:13,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1248242228, now seen corresponding path program 32 times [2018-12-03 15:50:13,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:13,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:13,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:13,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:13,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:13,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:13,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:13,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:13,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:13,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:13,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:13,652 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:13,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:13,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:13,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 15:50:13,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:13,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:13,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:15,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:15,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 15:50:15,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:15,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:50:15,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:50:15,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:50:15,246 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 35 states. [2018-12-03 15:50:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:15,350 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-03 15:50:15,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:50:15,350 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-12-03 15:50:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:15,351 INFO L225 Difference]: With dead ends: 141 [2018-12-03 15:50:15,351 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 15:50:15,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:50:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 15:50:15,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 15:50:15,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 15:50:15,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-12-03 15:50:15,355 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 134 [2018-12-03 15:50:15,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:15,355 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-12-03 15:50:15,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:50:15,356 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-12-03 15:50:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 15:50:15,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:15,357 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:15,357 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:15,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash -596451978, now seen corresponding path program 33 times [2018-12-03 15:50:15,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:15,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:15,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:15,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:16,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:16,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:16,178 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:16,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:16,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:16,178 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:16,188 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:16,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:16,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:16,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:16,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:16,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:17,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:17,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 15:50:17,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:17,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:50:17,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:50:17,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:50:17,677 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 36 states. [2018-12-03 15:50:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:17,771 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-12-03 15:50:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:50:17,772 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 138 [2018-12-03 15:50:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:17,773 INFO L225 Difference]: With dead ends: 145 [2018-12-03 15:50:17,773 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 15:50:17,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:50:17,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 15:50:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 15:50:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 15:50:17,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-12-03 15:50:17,777 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 138 [2018-12-03 15:50:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:17,778 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-12-03 15:50:17,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:50:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-12-03 15:50:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 15:50:17,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:17,779 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:17,779 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:17,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:17,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1720483872, now seen corresponding path program 34 times [2018-12-03 15:50:17,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:17,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:17,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:17,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:17,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:18,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:18,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:18,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:18,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:18,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:18,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:18,358 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:18,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:18,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:18,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:18,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:18,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:20,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:20,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 15:50:20,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:20,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:50:20,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:50:20,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:50:20,261 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 37 states. [2018-12-03 15:50:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:20,323 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-12-03 15:50:20,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:50:20,324 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 142 [2018-12-03 15:50:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:20,325 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:50:20,326 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 15:50:20,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:50:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 15:50:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 15:50:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:50:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-12-03 15:50:20,330 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 142 [2018-12-03 15:50:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:20,330 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-12-03 15:50:20,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:50:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-12-03 15:50:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 15:50:20,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:20,332 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:20,332 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:20,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash 811646410, now seen corresponding path program 35 times [2018-12-03 15:50:20,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:20,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:20,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:20,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:20,333 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:21,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:21,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:21,404 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:21,404 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:21,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:21,404 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:21,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:21,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:21,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 15:50:21,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:21,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:21,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:22,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:22,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 15:50:22,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:22,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:50:22,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:50:22,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:50:22,971 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 38 states. [2018-12-03 15:50:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:23,160 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-12-03 15:50:23,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:50:23,161 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 146 [2018-12-03 15:50:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:23,162 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:50:23,162 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 15:50:23,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:50:23,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 15:50:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 15:50:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 15:50:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-12-03 15:50:23,166 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 146 [2018-12-03 15:50:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:23,167 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-12-03 15:50:23,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:50:23,167 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-12-03 15:50:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 15:50:23,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:23,168 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:23,168 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:23,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:23,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1428821620, now seen corresponding path program 36 times [2018-12-03 15:50:23,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:23,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:23,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:23,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:23,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:23,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:23,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:23,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:23,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:23,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:23,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:23,792 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:23,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:23,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:23,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:23,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:23,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:23,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:25,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:25,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 15:50:25,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:25,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:50:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:50:25,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:50:25,845 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 39 states. [2018-12-03 15:50:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:25,898 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-12-03 15:50:25,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:50:25,898 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 150 [2018-12-03 15:50:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:25,900 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:50:25,900 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 15:50:25,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:50:25,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 15:50:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 15:50:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 15:50:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-12-03 15:50:25,905 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 150 [2018-12-03 15:50:25,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:25,905 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-12-03 15:50:25,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:50:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-12-03 15:50:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 15:50:25,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:25,906 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:25,907 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:25,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash -823981538, now seen corresponding path program 37 times [2018-12-03 15:50:25,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:25,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:25,908 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:26,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:26,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:26,712 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:26,712 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:26,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:26,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:26,712 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:26,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:26,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:26,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:26,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:28,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:28,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 15:50:28,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:28,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:50:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:50:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:50:28,610 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 40 states. [2018-12-03 15:50:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:28,680 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-12-03 15:50:28,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:50:28,681 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 154 [2018-12-03 15:50:28,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:28,682 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:50:28,682 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 15:50:28,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:50:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 15:50:28,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 15:50:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 15:50:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-12-03 15:50:28,687 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 154 [2018-12-03 15:50:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:28,688 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-12-03 15:50:28,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:50:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-12-03 15:50:28,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 15:50:28,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:28,689 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:28,689 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:28,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash 373692616, now seen corresponding path program 38 times [2018-12-03 15:50:28,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:28,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:28,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:28,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:28,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:29,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:29,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:29,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:29,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:29,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:29,546 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:29,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:29,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:29,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 15:50:29,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:29,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:29,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:32,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:32,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:32,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 15:50:32,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:32,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:50:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:50:32,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:50:32,115 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 41 states. [2018-12-03 15:50:32,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:32,795 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-03 15:50:32,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:50:32,796 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 158 [2018-12-03 15:50:32,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:32,797 INFO L225 Difference]: With dead ends: 165 [2018-12-03 15:50:32,797 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:50:32,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:50:32,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:50:32,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 15:50:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 15:50:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-12-03 15:50:32,800 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 158 [2018-12-03 15:50:32,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:32,801 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-12-03 15:50:32,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:50:32,801 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-12-03 15:50:32,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 15:50:32,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:32,802 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:32,802 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:32,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1026702734, now seen corresponding path program 39 times [2018-12-03 15:50:32,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:32,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:32,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:32,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:32,804 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:33,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:33,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:33,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:33,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:33,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:33,878 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:33,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:33,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:33,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:33,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:33,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:33,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:35,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:35,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 15:50:35,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:35,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:50:35,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:50:35,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:50:35,972 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 42 states. [2018-12-03 15:50:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:36,050 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-12-03 15:50:36,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:50:36,050 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 162 [2018-12-03 15:50:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:36,052 INFO L225 Difference]: With dead ends: 169 [2018-12-03 15:50:36,052 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 15:50:36,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:50:36,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 15:50:36,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-03 15:50:36,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 15:50:36,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-12-03 15:50:36,057 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 162 [2018-12-03 15:50:36,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:36,057 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-12-03 15:50:36,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:50:36,057 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-12-03 15:50:36,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 15:50:36,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:36,058 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:36,058 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:36,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:36,059 INFO L82 PathProgramCache]: Analyzing trace with hash 716474140, now seen corresponding path program 40 times [2018-12-03 15:50:36,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:36,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:36,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:36,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:36,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:36,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:36,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:36,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:36,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:36,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:36,946 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:36,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:36,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:36,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:37,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:39,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:39,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 15:50:39,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:39,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:50:39,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:50:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:50:39,026 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 43 states. [2018-12-03 15:50:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:39,138 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-12-03 15:50:39,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:50:39,138 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-12-03 15:50:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:39,140 INFO L225 Difference]: With dead ends: 173 [2018-12-03 15:50:39,140 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 15:50:39,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:50:39,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 15:50:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 15:50:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 15:50:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-12-03 15:50:39,144 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 166 [2018-12-03 15:50:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:39,144 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-12-03 15:50:39,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:50:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-12-03 15:50:39,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 15:50:39,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:39,146 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:39,146 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:39,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:39,146 INFO L82 PathProgramCache]: Analyzing trace with hash 49604294, now seen corresponding path program 41 times [2018-12-03 15:50:39,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:39,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:39,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:39,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:39,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:41,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:41,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:41,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:41,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:41,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:41,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:41,895 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:41,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:41,904 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:41,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 15:50:41,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:41,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:41,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:41,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:43,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:43,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 15:50:43,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:43,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:50:43,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:50:43,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:50:43,938 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 44 states. [2018-12-03 15:50:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:44,026 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-12-03 15:50:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:50:44,026 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 170 [2018-12-03 15:50:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:44,028 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:50:44,028 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 15:50:44,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:50:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 15:50:44,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 15:50:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:50:44,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-12-03 15:50:44,032 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 170 [2018-12-03 15:50:44,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:44,032 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-12-03 15:50:44,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:50:44,032 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-12-03 15:50:44,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 15:50:44,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:44,033 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:44,034 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:44,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:44,034 INFO L82 PathProgramCache]: Analyzing trace with hash -11968144, now seen corresponding path program 42 times [2018-12-03 15:50:44,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:44,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:44,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:44,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:46,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:46,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:46,039 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:46,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:46,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:46,040 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:46,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:46,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:46,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:46,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:46,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:46,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:46,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:48,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:48,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 15:50:48,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:48,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:50:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:50:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:50:48,125 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 45 states. [2018-12-03 15:50:48,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:48,224 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-12-03 15:50:48,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:50:48,224 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 174 [2018-12-03 15:50:48,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:48,225 INFO L225 Difference]: With dead ends: 181 [2018-12-03 15:50:48,225 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 15:50:48,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:50:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 15:50:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 15:50:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 15:50:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-12-03 15:50:48,229 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 174 [2018-12-03 15:50:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:48,229 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-12-03 15:50:48,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:50:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-12-03 15:50:48,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 15:50:48,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:48,231 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:48,231 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:48,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:48,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1915516698, now seen corresponding path program 43 times [2018-12-03 15:50:48,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:48,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:48,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:49,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:49,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:49,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:49,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:49,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:49,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:49,788 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:49,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:49,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:49,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:49,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:52,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:52,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 15:50:52,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:52,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:50:52,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:50:52,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:50:52,390 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 46 states. [2018-12-03 15:50:52,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:52,486 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-12-03 15:50:52,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:50:52,487 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 178 [2018-12-03 15:50:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:52,488 INFO L225 Difference]: With dead ends: 185 [2018-12-03 15:50:52,488 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 15:50:52,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:50:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 15:50:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-03 15:50:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 15:50:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-12-03 15:50:52,493 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 178 [2018-12-03 15:50:52,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:52,493 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-12-03 15:50:52,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:50:52,493 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-12-03 15:50:52,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 15:50:52,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:52,494 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:52,494 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:52,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash -321345596, now seen corresponding path program 44 times [2018-12-03 15:50:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:52,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:52,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:52,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:53,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:53,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:53,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:53,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:53,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:53,340 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:53,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:53,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:53,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 15:50:53,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:53,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:53,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:55,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:55,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:55,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 15:50:55,887 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:55,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:50:55,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:50:55,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:50:55,889 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 47 states. [2018-12-03 15:50:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:55,968 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-12-03 15:50:55,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:50:55,968 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 182 [2018-12-03 15:50:55,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:55,970 INFO L225 Difference]: With dead ends: 189 [2018-12-03 15:50:55,970 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 15:50:55,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:50:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 15:50:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 15:50:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 15:50:55,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-12-03 15:50:55,974 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 182 [2018-12-03 15:50:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:55,974 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-12-03 15:50:55,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:50:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-12-03 15:50:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 15:50:55,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:55,975 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:55,976 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:55,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:55,976 INFO L82 PathProgramCache]: Analyzing trace with hash -548899986, now seen corresponding path program 45 times [2018-12-03 15:50:55,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:55,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:55,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:56,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:56,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:56,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:56,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 15:50:56,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:56,940 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:56,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:56,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:56,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:56,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:56,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:57,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:59,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:59,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 15:50:59,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:59,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:50:59,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:50:59,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:50:59,563 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 48 states. [2018-12-03 15:50:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:59,671 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-12-03 15:50:59,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:50:59,672 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 186 [2018-12-03 15:50:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:59,674 INFO L225 Difference]: With dead ends: 193 [2018-12-03 15:50:59,674 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 15:50:59,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:50:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 15:50:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-03 15:50:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-03 15:50:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-12-03 15:50:59,678 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 186 [2018-12-03 15:50:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:59,678 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-12-03 15:50:59,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:50:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-12-03 15:50:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-03 15:50:59,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:59,680 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1] [2018-12-03 15:50:59,680 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:59,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash 943086104, now seen corresponding path program 46 times [2018-12-03 15:50:59,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:59,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:59,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:59,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:59,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:01,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:01,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:01,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:01,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:01,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 15:51:01,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:01,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:01,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:01,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:01,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:01,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:01,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:03,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:03,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:03,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 15:51:03,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:03,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:51:03,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:51:03,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:51:03,690 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 49 states. [2018-12-03 15:51:03,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:03,779 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-12-03 15:51:03,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:51:03,780 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 190 [2018-12-03 15:51:03,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:03,781 INFO L225 Difference]: With dead ends: 197 [2018-12-03 15:51:03,781 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 15:51:03,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:51:03,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 15:51:03,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-03 15:51:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 15:51:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-12-03 15:51:03,786 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 190 [2018-12-03 15:51:03,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:03,786 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-12-03 15:51:03,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:51:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-12-03 15:51:03,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 15:51:03,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:03,787 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:03,787 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:03,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:03,787 INFO L82 PathProgramCache]: Analyzing trace with hash 85777346, now seen corresponding path program 47 times [2018-12-03 15:51:03,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:03,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:03,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:03,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:03,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:05,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:05,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:05,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:05,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:05,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:05,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:05,038 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:05,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:05,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:05,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 15:51:05,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:05,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:05,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:07,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:07,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:07,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 15:51:07,909 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:07,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:51:07,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:51:07,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:51:07,911 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 50 states. [2018-12-03 15:51:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:08,023 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-12-03 15:51:08,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:51:08,023 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 194 [2018-12-03 15:51:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:08,025 INFO L225 Difference]: With dead ends: 201 [2018-12-03 15:51:08,025 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 15:51:08,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:51:08,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 15:51:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-03 15:51:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 15:51:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-12-03 15:51:08,031 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 194 [2018-12-03 15:51:08,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:08,031 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-12-03 15:51:08,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:51:08,031 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-12-03 15:51:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 15:51:08,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:08,032 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:08,033 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:08,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 305559660, now seen corresponding path program 48 times [2018-12-03 15:51:08,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:08,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:08,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:09,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:09,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:09,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:09,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:09,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:09,474 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:09,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:09,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:09,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:09,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:09,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:09,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:12,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:12,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 15:51:12,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:12,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:51:12,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:51:12,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:51:12,301 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 51 states. [2018-12-03 15:51:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:12,420 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-12-03 15:51:12,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:51:12,420 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 198 [2018-12-03 15:51:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:12,421 INFO L225 Difference]: With dead ends: 205 [2018-12-03 15:51:12,421 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 15:51:12,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:51:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 15:51:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-03 15:51:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 15:51:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-12-03 15:51:12,425 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 198 [2018-12-03 15:51:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:12,425 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-12-03 15:51:12,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:51:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-12-03 15:51:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 15:51:12,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:12,426 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:12,427 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:12,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:12,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1971474410, now seen corresponding path program 49 times [2018-12-03 15:51:12,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:12,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:12,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:12,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:12,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:13,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:13,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:13,557 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:13,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:13,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:13,558 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:13,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:13,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:13,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:13,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:16,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:16,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:16,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 15:51:16,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:16,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:51:16,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:51:16,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:51:16,798 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 52 states. [2018-12-03 15:51:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:16,869 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-12-03 15:51:16,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:51:16,870 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 202 [2018-12-03 15:51:16,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:16,872 INFO L225 Difference]: With dead ends: 209 [2018-12-03 15:51:16,872 INFO L226 Difference]: Without dead ends: 207 [2018-12-03 15:51:16,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:51:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-03 15:51:16,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-03 15:51:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 15:51:16,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-12-03 15:51:16,876 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 202 [2018-12-03 15:51:16,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:16,876 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-12-03 15:51:16,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:51:16,876 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-12-03 15:51:16,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 15:51:16,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:16,878 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:16,878 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:16,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1750269248, now seen corresponding path program 50 times [2018-12-03 15:51:16,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:16,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:16,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:16,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:17,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:17,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:17,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:17,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:17,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:17,924 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:17,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:17,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:18,275 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 15:51:18,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:18,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:18,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:21,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:21,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 15:51:21,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:21,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:51:21,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:51:21,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:51:21,513 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 53 states. [2018-12-03 15:51:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:21,620 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-12-03 15:51:21,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:51:21,620 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 206 [2018-12-03 15:51:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:21,622 INFO L225 Difference]: With dead ends: 213 [2018-12-03 15:51:21,622 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 15:51:21,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:51:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 15:51:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 15:51:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 15:51:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-12-03 15:51:21,627 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 206 [2018-12-03 15:51:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:21,627 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-12-03 15:51:21,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:51:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-12-03 15:51:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 15:51:21,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:21,628 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:21,629 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:21,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash 37679210, now seen corresponding path program 51 times [2018-12-03 15:51:21,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:21,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:21,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:21,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:22,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:22,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:22,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:22,803 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:22,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:22,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:22,803 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:22,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:22,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:22,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:22,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:22,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:22,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:26,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:26,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:26,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 15:51:26,549 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:26,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:51:26,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:51:26,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:51:26,551 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 54 states. [2018-12-03 15:51:26,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:26,673 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-12-03 15:51:26,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:51:26,673 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 210 [2018-12-03 15:51:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:26,675 INFO L225 Difference]: With dead ends: 217 [2018-12-03 15:51:26,675 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 15:51:26,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:51:26,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 15:51:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-12-03 15:51:26,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-03 15:51:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-12-03 15:51:26,679 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 210 [2018-12-03 15:51:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:26,680 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-12-03 15:51:26,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:51:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-12-03 15:51:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-12-03 15:51:26,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:26,681 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:26,681 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:26,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash -781321964, now seen corresponding path program 52 times [2018-12-03 15:51:26,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:26,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:26,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:26,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:26,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:27,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:27,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:27,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:27,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:27,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:27,797 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:27,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:27,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:27,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:27,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:30,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:30,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 15:51:30,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:30,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:51:30,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:51:30,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:51:30,910 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 55 states. [2018-12-03 15:51:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:31,038 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-12-03 15:51:31,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:51:31,038 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 214 [2018-12-03 15:51:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:31,040 INFO L225 Difference]: With dead ends: 221 [2018-12-03 15:51:31,040 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 15:51:31,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:51:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 15:51:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-03 15:51:31,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-03 15:51:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-12-03 15:51:31,044 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 214 [2018-12-03 15:51:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:31,044 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-12-03 15:51:31,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:51:31,045 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-12-03 15:51:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 15:51:31,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:31,045 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:31,046 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:31,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:31,046 INFO L82 PathProgramCache]: Analyzing trace with hash -348873538, now seen corresponding path program 53 times [2018-12-03 15:51:31,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:31,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:31,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:31,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:32,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:32,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:32,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:32,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:32,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:32,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:32,553 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:32,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:32,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:32,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 15:51:32,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:32,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:32,680 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:32,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:35,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:35,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:35,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 15:51:35,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:35,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:51:35,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:51:35,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:51:35,797 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 56 states. [2018-12-03 15:51:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:35,918 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-12-03 15:51:35,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:51:35,919 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 218 [2018-12-03 15:51:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:35,920 INFO L225 Difference]: With dead ends: 225 [2018-12-03 15:51:35,920 INFO L226 Difference]: Without dead ends: 223 [2018-12-03 15:51:35,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 489 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:51:35,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-12-03 15:51:35,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-12-03 15:51:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-03 15:51:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-12-03 15:51:35,925 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 218 [2018-12-03 15:51:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:35,925 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-12-03 15:51:35,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:51:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-12-03 15:51:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 15:51:35,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:35,926 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:35,926 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:35,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1269998744, now seen corresponding path program 54 times [2018-12-03 15:51:35,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:35,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:35,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:37,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:37,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:37,485 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:37,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:37,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:37,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:37,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:37,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:37,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:37,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:37,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:37,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:40,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:40,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 15:51:40,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:40,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:51:40,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:51:40,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:51:40,734 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 57 states. [2018-12-03 15:51:40,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:40,834 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-12-03 15:51:40,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:51:40,834 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2018-12-03 15:51:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:40,836 INFO L225 Difference]: With dead ends: 229 [2018-12-03 15:51:40,836 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 15:51:40,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:51:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 15:51:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-12-03 15:51:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 15:51:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-12-03 15:51:40,840 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 222 [2018-12-03 15:51:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:40,840 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-12-03 15:51:40,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:51:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-12-03 15:51:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-03 15:51:40,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:40,842 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:40,842 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:40,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:40,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1338854126, now seen corresponding path program 55 times [2018-12-03 15:51:40,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:40,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:40,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:42,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:42,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:42,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:42,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:42,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:42,416 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:42,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:42,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:42,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:42,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:45,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:45,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 15:51:45,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:45,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:51:45,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:51:45,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:51:45,827 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 58 states. [2018-12-03 15:51:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:45,993 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-12-03 15:51:45,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:51:45,994 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 226 [2018-12-03 15:51:45,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:45,995 INFO L225 Difference]: With dead ends: 233 [2018-12-03 15:51:45,995 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 15:51:45,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:51:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 15:51:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-12-03 15:51:45,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-03 15:51:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-12-03 15:51:46,000 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 226 [2018-12-03 15:51:46,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:46,000 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-12-03 15:51:46,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:51:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-12-03 15:51:46,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-03 15:51:46,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:46,002 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:46,002 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:46,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:46,002 INFO L82 PathProgramCache]: Analyzing trace with hash 555690428, now seen corresponding path program 56 times [2018-12-03 15:51:46,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:46,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:46,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:46,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:46,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:47,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:47,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:47,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:47,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:47,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:47,617 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:47,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:47,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:47,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 15:51:47,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:47,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:47,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:51,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:51,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 15:51:51,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:51,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:51:51,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:51:51,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:51:51,128 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 59 states. [2018-12-03 15:51:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:51,245 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-12-03 15:51:51,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:51:51,245 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 230 [2018-12-03 15:51:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:51,246 INFO L225 Difference]: With dead ends: 237 [2018-12-03 15:51:51,246 INFO L226 Difference]: Without dead ends: 235 [2018-12-03 15:51:51,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:51:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-03 15:51:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-12-03 15:51:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-03 15:51:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-12-03 15:51:51,249 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 230 [2018-12-03 15:51:51,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:51,250 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-12-03 15:51:51,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:51:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-12-03 15:51:51,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-03 15:51:51,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:51,251 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:51,251 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:51,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:51,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1475528346, now seen corresponding path program 57 times [2018-12-03 15:51:51,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:51,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:51,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:51,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:51,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:52,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:52,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:52,973 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:52,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:52,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:52,974 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:52,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:52,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:53,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:53,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:53,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:53,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:56,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:56,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 15:51:56,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:56,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:51:56,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:51:56,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:51:56,585 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 60 states. [2018-12-03 15:51:56,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:56,733 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-12-03 15:51:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:51:56,733 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 234 [2018-12-03 15:51:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:56,735 INFO L225 Difference]: With dead ends: 241 [2018-12-03 15:51:56,735 INFO L226 Difference]: Without dead ends: 239 [2018-12-03 15:51:56,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:51:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-03 15:51:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-12-03 15:51:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-12-03 15:51:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-12-03 15:51:56,739 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 234 [2018-12-03 15:51:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:56,739 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-12-03 15:51:56,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:51:56,739 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-12-03 15:51:56,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-03 15:51:56,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:56,740 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 1, 1, 1, 1, 1, 1] [2018-12-03 15:51:56,740 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:56,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:56,741 INFO L82 PathProgramCache]: Analyzing trace with hash -457743344, now seen corresponding path program 58 times [2018-12-03 15:51:56,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:56,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:56,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:56,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:58,338 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:58,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:58,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:58,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:58,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:58,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:58,339 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:58,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:58,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:58,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:58,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:58,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:02,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:02,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 15:52:02,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:02,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:52:02,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:52:02,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:52:02,526 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 61 states. [2018-12-03 15:52:02,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:02,699 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-12-03 15:52:02,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:52:02,699 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 238 [2018-12-03 15:52:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:02,701 INFO L225 Difference]: With dead ends: 245 [2018-12-03 15:52:02,701 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 15:52:02,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 416 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:52:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 15:52:02,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-12-03 15:52:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 15:52:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-12-03 15:52:02,705 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 238 [2018-12-03 15:52:02,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:02,705 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-12-03 15:52:02,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:52:02,705 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-12-03 15:52:02,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-12-03 15:52:02,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:02,706 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 1, 1, 1, 1, 1, 1] [2018-12-03 15:52:02,706 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:02,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:02,707 INFO L82 PathProgramCache]: Analyzing trace with hash 362293690, now seen corresponding path program 59 times [2018-12-03 15:52:02,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:02,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:02,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:02,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:02,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:04,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:04,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:04,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:04,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:04,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:04,242 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:04,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:04,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:04,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 15:52:04,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:04,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:04,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:08,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:08,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 15:52:08,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:08,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:52:08,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:52:08,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:52:08,415 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 62 states. [2018-12-03 15:52:08,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:08,585 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-12-03 15:52:08,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:52:08,586 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 242 [2018-12-03 15:52:08,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:08,587 INFO L225 Difference]: With dead ends: 249 [2018-12-03 15:52:08,588 INFO L226 Difference]: Without dead ends: 247 [2018-12-03 15:52:08,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 543 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:52:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-12-03 15:52:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-12-03 15:52:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-03 15:52:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-12-03 15:52:08,592 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 242 [2018-12-03 15:52:08,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:08,593 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-12-03 15:52:08,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:52:08,593 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-12-03 15:52:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-03 15:52:08,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:08,594 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 1, 1, 1, 1, 1, 1] [2018-12-03 15:52:08,595 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:08,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1209398684, now seen corresponding path program 60 times [2018-12-03 15:52:08,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:08,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:08,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:08,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:10,114 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:10,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:10,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:10,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:10,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:10,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:10,115 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:10,124 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:10,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:10,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:10,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:10,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:10,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:14,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:14,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 15:52:14,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:14,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:52:14,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:52:14,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:52:14,410 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 63 states. [2018-12-03 15:52:14,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:14,604 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-12-03 15:52:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:52:14,604 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 246 [2018-12-03 15:52:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:14,606 INFO L225 Difference]: With dead ends: 253 [2018-12-03 15:52:14,606 INFO L226 Difference]: Without dead ends: 251 [2018-12-03 15:52:14,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:52:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-03 15:52:14,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-12-03 15:52:14,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-03 15:52:14,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-12-03 15:52:14,610 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 246 [2018-12-03 15:52:14,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:14,610 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-12-03 15:52:14,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:52:14,610 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-12-03 15:52:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-03 15:52:14,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:14,611 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 1, 1, 1, 1, 1, 1] [2018-12-03 15:52:14,611 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:14,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:14,611 INFO L82 PathProgramCache]: Analyzing trace with hash 665290254, now seen corresponding path program 61 times [2018-12-03 15:52:14,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:14,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:14,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:14,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:14,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:16,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:16,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:16,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:16,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:16,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:16,130 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:16,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:16,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:16,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:16,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:20,601 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:20,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:20,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 15:52:20,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:20,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:52:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:52:20,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:52:20,621 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 64 states. [2018-12-03 15:52:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:20,771 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-12-03 15:52:20,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:52:20,771 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 250 [2018-12-03 15:52:20,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:20,773 INFO L225 Difference]: With dead ends: 257 [2018-12-03 15:52:20,773 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 15:52:20,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 437 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:52:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 15:52:20,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-12-03 15:52:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 15:52:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-12-03 15:52:20,777 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 250 [2018-12-03 15:52:20,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:20,778 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-12-03 15:52:20,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:52:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-12-03 15:52:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-03 15:52:20,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:20,779 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 1, 1, 1, 1, 1, 1] [2018-12-03 15:52:20,779 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:20,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:20,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1066081464, now seen corresponding path program 62 times [2018-12-03 15:52:20,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:20,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:20,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:22,286 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:22,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:22,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:22,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:22,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 15:52:22,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:22,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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:22,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:22,295 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:22,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 15:52:22,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:22,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:22,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:26,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:26,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 15:52:26,770 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:26,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:52:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:52:26,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:52:26,772 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 65 states. [2018-12-03 15:52:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:26,925 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-12-03 15:52:26,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:52:26,926 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 254 [2018-12-03 15:52:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:26,927 INFO L225 Difference]: With dead ends: 261 [2018-12-03 15:52:26,927 INFO L226 Difference]: Without dead ends: 259 [2018-12-03 15:52:26,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:52:26,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-03 15:52:26,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-12-03 15:52:26,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-03 15:52:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-12-03 15:52:26,931 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 254 [2018-12-03 15:52:26,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:26,932 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-12-03 15:52:26,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:52:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-12-03 15:52:26,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-03 15:52:26,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:26,933 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 1, 1, 1, 1, 1, 1] [2018-12-03 15:52:26,933 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:26,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:26,934 INFO L82 PathProgramCache]: Analyzing trace with hash -116437406, now seen corresponding path program 63 times [2018-12-03 15:52:26,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:26,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:26,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:26,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:26,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:28,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:28,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:28,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:28,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:28,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:28,827 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:28,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:28,889 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:28,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:28,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:28,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:28,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:33,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:33,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:33,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 15:52:33,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:33,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:52:33,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:52:33,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:52:33,454 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 66 states. [2018-12-03 15:52:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:33,652 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-12-03 15:52:33,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:52:33,653 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 258 [2018-12-03 15:52:33,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:33,654 INFO L225 Difference]: With dead ends: 265 [2018-12-03 15:52:33,654 INFO L226 Difference]: Without dead ends: 263 [2018-12-03 15:52:33,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 451 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:52:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-03 15:52:33,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-12-03 15:52:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-03 15:52:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-12-03 15:52:33,659 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 258 [2018-12-03 15:52:33,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:33,660 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-12-03 15:52:33,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:52:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-12-03 15:52:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-12-03 15:52:33,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:33,661 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 1, 1, 1, 1, 1, 1] [2018-12-03 15:52:33,661 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:33,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:33,662 INFO L82 PathProgramCache]: Analyzing trace with hash 208575244, now seen corresponding path program 64 times [2018-12-03 15:52:33,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:33,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:33,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:33,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:33,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:33,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:35,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:35,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:35,281 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:35,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:35,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:35,281 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:35,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:35,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:35,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:35,396 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:40,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:40,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 15:52:40,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:40,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:52:40,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:52:40,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:52:40,141 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 67 states. [2018-12-03 15:52:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:40,267 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-12-03 15:52:40,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:52:40,267 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 262 [2018-12-03 15:52:40,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:40,269 INFO L225 Difference]: With dead ends: 269 [2018-12-03 15:52:40,269 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 15:52:40,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 458 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:52:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 15:52:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-12-03 15:52:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-03 15:52:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-12-03 15:52:40,274 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 262 [2018-12-03 15:52:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:40,275 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-12-03 15:52:40,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:52:40,275 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-12-03 15:52:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-12-03 15:52:40,276 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:40,276 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 1, 1, 1, 1, 1, 1] [2018-12-03 15:52:40,276 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:40,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:40,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1868332362, now seen corresponding path program 65 times [2018-12-03 15:52:40,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:40,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:40,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:40,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:40,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:40,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:42,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:42,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:42,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:42,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:42,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:42,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:42,613 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:42,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:42,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:42,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 15:52:42,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:42,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:42,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:47,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:47,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 15:52:47,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:47,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:52:47,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:52:47,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:52:47,607 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 68 states. [2018-12-03 15:52:47,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:47,815 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-12-03 15:52:47,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:52:47,815 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 266 [2018-12-03 15:52:47,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:47,817 INFO L225 Difference]: With dead ends: 273 [2018-12-03 15:52:47,817 INFO L226 Difference]: Without dead ends: 271 [2018-12-03 15:52:47,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 465 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:52:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-03 15:52:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-12-03 15:52:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-03 15:52:47,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-12-03 15:52:47,822 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 266 [2018-12-03 15:52:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:47,822 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-12-03 15:52:47,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:52:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-12-03 15:52:47,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-03 15:52:47,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:47,824 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 1, 1, 1, 1, 1, 1] [2018-12-03 15:52:47,824 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:47,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:47,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1687648928, now seen corresponding path program 66 times [2018-12-03 15:52:47,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:47,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:47,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:47,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:47,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:49,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:49,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:49,683 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:49,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:49,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:49,684 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:49,692 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:49,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:49,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:49,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:49,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:49,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:54,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:54,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 15:52:54,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:54,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:52:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:52:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:52:54,706 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 69 states. [2018-12-03 15:52:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:54,877 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-12-03 15:52:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:52:54,877 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 270 [2018-12-03 15:52:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:54,879 INFO L225 Difference]: With dead ends: 277 [2018-12-03 15:52:54,879 INFO L226 Difference]: Without dead ends: 275 [2018-12-03 15:52:54,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 472 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:52:54,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-03 15:52:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-12-03 15:52:54,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 15:52:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-12-03 15:52:54,883 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 270 [2018-12-03 15:52:54,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:54,883 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-12-03 15:52:54,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:52:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-12-03 15:52:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-03 15:52:54,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:54,885 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 1, 1, 1, 1, 1, 1] [2018-12-03 15:52:54,885 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:54,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:54,885 INFO L82 PathProgramCache]: Analyzing trace with hash -516414710, now seen corresponding path program 67 times [2018-12-03 15:52:54,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:54,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:54,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:56,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:56,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:56,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:56,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:56,581 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:56,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:56,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:56,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:01,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 15:53:01,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:01,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:53:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:53:01,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:53:01,779 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 70 states. [2018-12-03 15:53:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:01,954 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-12-03 15:53:01,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:53:01,955 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 274 [2018-12-03 15:53:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:01,956 INFO L225 Difference]: With dead ends: 281 [2018-12-03 15:53:01,956 INFO L226 Difference]: Without dead ends: 279 [2018-12-03 15:53:01,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:53:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-03 15:53:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-12-03 15:53:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-12-03 15:53:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-12-03 15:53:01,961 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 274 [2018-12-03 15:53:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:01,961 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-12-03 15:53:01,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:53:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-12-03 15:53:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-12-03 15:53:01,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:01,963 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 1, 1, 1, 1, 1, 1] [2018-12-03 15:53:01,963 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:01,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1431100340, now seen corresponding path program 68 times [2018-12-03 15:53:01,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:01,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:01,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:01,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:01,965 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:04,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:04,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:04,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:04,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:04,123 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:04,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:04,131 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:04,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 15:53:04,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:04,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:04,285 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:09,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 15:53:09,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:09,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:53:09,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:53:09,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:53:09,610 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 71 states. [2018-12-03 15:53:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:09,861 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-12-03 15:53:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:53:09,862 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 278 [2018-12-03 15:53:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:09,863 INFO L225 Difference]: With dead ends: 285 [2018-12-03 15:53:09,863 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 15:53:09,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 486 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:53:09,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 15:53:09,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-12-03 15:53:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-03 15:53:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-12-03 15:53:09,866 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 278 [2018-12-03 15:53:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:09,867 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-12-03 15:53:09,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:53:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-12-03 15:53:09,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-03 15:53:09,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:09,868 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 1, 1, 1, 1, 1, 1] [2018-12-03 15:53:09,868 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:09,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:09,868 INFO L82 PathProgramCache]: Analyzing trace with hash -912183458, now seen corresponding path program 69 times [2018-12-03 15:53:09,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:09,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:09,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:09,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:09,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:11,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,713 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:11,713 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:11,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:11,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:11,713 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:11,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:11,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:11,776 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:11,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:11,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:11,839 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:11,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:17,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:17,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 15:53:17,274 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:17,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:53:17,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:53:17,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:53:17,276 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 72 states. [2018-12-03 15:53:17,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:17,442 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-12-03 15:53:17,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:53:17,442 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 282 [2018-12-03 15:53:17,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:17,443 INFO L225 Difference]: With dead ends: 289 [2018-12-03 15:53:17,443 INFO L226 Difference]: Without dead ends: 287 [2018-12-03 15:53:17,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:53:17,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-03 15:53:17,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-12-03 15:53:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-12-03 15:53:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-12-03 15:53:17,446 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 282 [2018-12-03 15:53:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:17,447 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-12-03 15:53:17,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:53:17,447 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-12-03 15:53:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-12-03 15:53:17,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:17,448 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 1, 1, 1, 1, 1, 1] [2018-12-03 15:53:17,448 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:17,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:17,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1896899064, now seen corresponding path program 70 times [2018-12-03 15:53:17,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:17,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:17,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:17,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:17,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:19,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:19,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:19,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:19,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:19,544 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:19,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:19,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:19,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:19,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:25,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:25,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 15:53:25,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:25,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:53:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:53:25,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:53:25,243 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 73 states. [2018-12-03 15:53:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:25,490 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-12-03 15:53:25,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:53:25,491 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 286 [2018-12-03 15:53:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:25,492 INFO L225 Difference]: With dead ends: 293 [2018-12-03 15:53:25,492 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 15:53:25,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 500 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:53:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 15:53:25,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-12-03 15:53:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-03 15:53:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-12-03 15:53:25,496 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 286 [2018-12-03 15:53:25,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:25,496 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-12-03 15:53:25,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:53:25,496 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-12-03 15:53:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-12-03 15:53:25,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:25,497 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 1, 1, 1, 1, 1, 1] [2018-12-03 15:53:25,497 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:25,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:25,498 INFO L82 PathProgramCache]: Analyzing trace with hash 347252658, now seen corresponding path program 71 times [2018-12-03 15:53:25,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:25,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:25,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:27,489 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:27,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:27,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:27,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:27,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:27,490 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:27,498 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:27,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:27,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 15:53:27,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:27,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:33,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 15:53:33,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:33,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:53:33,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:53:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:53:33,487 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 74 states. [2018-12-03 15:53:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:33,734 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-12-03 15:53:33,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:53:33,735 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 290 [2018-12-03 15:53:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:33,736 INFO L225 Difference]: With dead ends: 297 [2018-12-03 15:53:33,737 INFO L226 Difference]: Without dead ends: 295 [2018-12-03 15:53:33,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 507 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:53:33,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-12-03 15:53:33,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-12-03 15:53:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-12-03 15:53:33,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-12-03 15:53:33,741 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 290 [2018-12-03 15:53:33,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:33,741 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-12-03 15:53:33,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:53:33,742 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-12-03 15:53:33,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-03 15:53:33,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:33,743 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 1, 1, 1, 1, 1, 1] [2018-12-03 15:53:33,743 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:33,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:33,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1994077092, now seen corresponding path program 72 times [2018-12-03 15:53:33,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:33,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:33,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:33,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:36,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:36,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:36,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,052 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:36,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:36,063 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:36,120 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:36,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:36,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:42,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:42,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 15:53:42,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:42,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:53:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:53:42,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:53:42,067 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 75 states. [2018-12-03 15:53:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:42,243 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-12-03 15:53:42,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:53:42,244 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 294 [2018-12-03 15:53:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:42,246 INFO L225 Difference]: With dead ends: 301 [2018-12-03 15:53:42,246 INFO L226 Difference]: Without dead ends: 299 [2018-12-03 15:53:42,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:53:42,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-03 15:53:42,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-12-03 15:53:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-12-03 15:53:42,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-12-03 15:53:42,250 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 294 [2018-12-03 15:53:42,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:42,250 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-12-03 15:53:42,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:53:42,250 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-12-03 15:53:42,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-12-03 15:53:42,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:42,251 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 1, 1, 1, 1, 1, 1] [2018-12-03 15:53:42,251 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:42,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:42,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2034273286, now seen corresponding path program 73 times [2018-12-03 15:53:42,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:42,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:42,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:42,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:44,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:44,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:44,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:44,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:44,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:44,250 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:44,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:44,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:44,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:50,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:50,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 15:53:50,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:50,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:53:50,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:53:50,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:53:50,565 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 76 states. [2018-12-03 15:53:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:50,842 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-12-03 15:53:50,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:53:50,842 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 298 [2018-12-03 15:53:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:50,844 INFO L225 Difference]: With dead ends: 305 [2018-12-03 15:53:50,844 INFO L226 Difference]: Without dead ends: 303 [2018-12-03 15:53:50,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 521 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:53:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-03 15:53:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-12-03 15:53:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-12-03 15:53:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-12-03 15:53:50,849 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 298 [2018-12-03 15:53:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:50,849 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-12-03 15:53:50,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:53:50,849 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-12-03 15:53:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-12-03 15:53:50,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:50,851 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 1, 1, 1, 1, 1, 1] [2018-12-03 15:53:50,851 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:50,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:50,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1891657392, now seen corresponding path program 74 times [2018-12-03 15:53:50,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:50,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:50,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:50,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:50,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:52,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:52,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:52,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:52,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:52,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:52,932 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:52,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:52,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:53,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-03 15:53:53,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:53,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:53,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:59,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:59,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 15:53:59,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:59,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:53:59,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:53:59,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:53:59,331 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 77 states. [2018-12-03 15:53:59,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:59,625 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-12-03 15:53:59,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:53:59,626 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 302 [2018-12-03 15:53:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:59,628 INFO L225 Difference]: With dead ends: 309 [2018-12-03 15:53:59,628 INFO L226 Difference]: Without dead ends: 307 [2018-12-03 15:53:59,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 678 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:53:59,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-03 15:53:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-12-03 15:53:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-12-03 15:53:59,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-12-03 15:53:59,633 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 302 [2018-12-03 15:53:59,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:59,633 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-12-03 15:53:59,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:53:59,633 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-12-03 15:53:59,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-12-03 15:53:59,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:59,635 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 1, 1, 1, 1, 1, 1] [2018-12-03 15:53:59,635 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:59,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:59,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1709253542, now seen corresponding path program 75 times [2018-12-03 15:53:59,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:59,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:59,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:59,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:59,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:01,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:01,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:01,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:01,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:01,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:01,859 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:01,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:01,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:01,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:01,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:01,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:02,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:08,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:08,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 15:54:08,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:08,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:54:08,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:54:08,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:54:08,364 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 78 states. [2018-12-03 15:54:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:08,653 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-12-03 15:54:08,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:54:08,654 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 306 [2018-12-03 15:54:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:08,656 INFO L225 Difference]: With dead ends: 313 [2018-12-03 15:54:08,656 INFO L226 Difference]: Without dead ends: 311 [2018-12-03 15:54:08,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:54:08,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-03 15:54:08,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-12-03 15:54:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-12-03 15:54:08,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-12-03 15:54:08,660 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 306 [2018-12-03 15:54:08,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:08,660 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-12-03 15:54:08,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:54:08,660 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-12-03 15:54:08,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-12-03 15:54:08,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:08,662 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 1, 1, 1, 1, 1, 1] [2018-12-03 15:54:08,662 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:08,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:08,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1586916612, now seen corresponding path program 76 times [2018-12-03 15:54:08,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:08,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:08,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:08,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:08,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:11,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:11,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:11,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:11,134 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:11,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:11,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:11,134 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:11,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:11,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:11,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:11,289 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:11,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:17,814 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:17,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:17,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 15:54:17,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:17,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:54:17,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:54:17,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:54:17,835 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 79 states. [2018-12-03 15:54:18,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:18,024 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-12-03 15:54:18,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:54:18,025 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 310 [2018-12-03 15:54:18,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:18,027 INFO L225 Difference]: With dead ends: 317 [2018-12-03 15:54:18,027 INFO L226 Difference]: Without dead ends: 315 [2018-12-03 15:54:18,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:54:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-03 15:54:18,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-12-03 15:54:18,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-03 15:54:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-12-03 15:54:18,031 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 310 [2018-12-03 15:54:18,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:18,031 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-12-03 15:54:18,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:54:18,031 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-12-03 15:54:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-12-03 15:54:18,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:18,032 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 1, 1, 1, 1, 1, 1] [2018-12-03 15:54:18,032 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:18,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash 102865070, now seen corresponding path program 77 times [2018-12-03 15:54:18,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:18,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:18,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:18,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:18,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:20,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:20,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:20,573 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:20,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:20,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:20,573 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:20,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:20,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:20,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-03 15:54:20,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:20,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:20,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:27,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:27,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 15:54:27,504 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:27,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:54:27,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:54:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:54:27,506 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 80 states. [2018-12-03 15:54:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:27,819 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-12-03 15:54:27,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:54:27,819 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 314 [2018-12-03 15:54:27,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:27,821 INFO L225 Difference]: With dead ends: 321 [2018-12-03 15:54:27,821 INFO L226 Difference]: Without dead ends: 319 [2018-12-03 15:54:27,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:54:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-03 15:54:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-12-03 15:54:27,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-12-03 15:54:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-12-03 15:54:27,825 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 314 [2018-12-03 15:54:27,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:27,825 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-12-03 15:54:27,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:54:27,825 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-12-03 15:54:27,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-12-03 15:54:27,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:27,827 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 1, 1, 1, 1, 1, 1] [2018-12-03 15:54:27,827 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:27,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:27,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1467670360, now seen corresponding path program 78 times [2018-12-03 15:54:27,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:27,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:27,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:27,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:27,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:30,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:30,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:30,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:30,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:30,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:30,130 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:30,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:30,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:30,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:30,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:30,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:30,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:37,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:37,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 15:54:37,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:37,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 15:54:37,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 15:54:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:54:37,401 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 81 states. [2018-12-03 15:54:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:38,244 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-12-03 15:54:38,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:54:38,244 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 318 [2018-12-03 15:54:38,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:38,246 INFO L225 Difference]: With dead ends: 325 [2018-12-03 15:54:38,246 INFO L226 Difference]: Without dead ends: 323 [2018-12-03 15:54:38,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 714 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:54:38,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-12-03 15:54:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-12-03 15:54:38,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-12-03 15:54:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-12-03 15:54:38,250 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 318 [2018-12-03 15:54:38,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:38,250 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-12-03 15:54:38,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 15:54:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-12-03 15:54:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-12-03 15:54:38,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:38,251 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 1, 1, 1, 1, 1, 1] [2018-12-03 15:54:38,251 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:38,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:38,252 INFO L82 PathProgramCache]: Analyzing trace with hash 941408514, now seen corresponding path program 79 times [2018-12-03 15:54:38,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:38,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:38,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:38,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:40,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:40,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:40,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:40,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 15:54:40,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:40,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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:40,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:40,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:40,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:40,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:47,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:47,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 15:54:47,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:47,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:54:47,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:54:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:54:47,810 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 82 states. [2018-12-03 15:54:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:48,158 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-12-03 15:54:48,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:54:48,164 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 322 [2018-12-03 15:54:48,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:48,165 INFO L225 Difference]: With dead ends: 329 [2018-12-03 15:54:48,165 INFO L226 Difference]: Without dead ends: 327 [2018-12-03 15:54:48,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 723 GetRequests, 563 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:54:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-12-03 15:54:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-12-03 15:54:48,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-12-03 15:54:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-12-03 15:54:48,169 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 322 [2018-12-03 15:54:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:48,169 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-12-03 15:54:48,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:54:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-12-03 15:54:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-12-03 15:54:48,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:48,170 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 1, 1, 1, 1, 1, 1] [2018-12-03 15:54:48,170 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:48,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:48,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1279376812, now seen corresponding path program 80 times [2018-12-03 15:54:48,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:48,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:48,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:48,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:48,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:50,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:50,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:50,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:50,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:50,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:50,586 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:50,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:50,595 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:50,709 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-03 15:54:50,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:50,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:50,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:58,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:58,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:58,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 15:54:58,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:58,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 15:54:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 15:54:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:54:58,376 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 83 states. [2018-12-03 15:54:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:58,638 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-12-03 15:54:58,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:54:58,638 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 326 [2018-12-03 15:54:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:58,639 INFO L225 Difference]: With dead ends: 333 [2018-12-03 15:54:58,640 INFO L226 Difference]: Without dead ends: 331 [2018-12-03 15:54:58,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:54:58,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-03 15:54:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-12-03 15:54:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-03 15:54:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-12-03 15:54:58,643 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 326 [2018-12-03 15:54:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:58,643 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-12-03 15:54:58,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 15:54:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-12-03 15:54:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-12-03 15:54:58,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:58,645 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 81, 1, 1, 1, 1, 1, 1] [2018-12-03 15:54:58,645 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:58,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1763420842, now seen corresponding path program 81 times [2018-12-03 15:54:58,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:58,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:58,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:01,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:01,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:01,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:01,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:01,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:01,071 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:01,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:01,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:01,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:01,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:01,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:01,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:08,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:08,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 15:55:08,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:08,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 15:55:08,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 15:55:08,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:55:08,807 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 84 states. [2018-12-03 15:55:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:09,045 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-12-03 15:55:09,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:55:09,045 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 330 [2018-12-03 15:55:09,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:09,046 INFO L225 Difference]: With dead ends: 337 [2018-12-03 15:55:09,046 INFO L226 Difference]: Without dead ends: 335 [2018-12-03 15:55:09,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:55:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-12-03 15:55:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-12-03 15:55:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-03 15:55:09,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-12-03 15:55:09,050 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 330 [2018-12-03 15:55:09,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:09,050 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-12-03 15:55:09,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 15:55:09,051 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-12-03 15:55:09,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-12-03 15:55:09,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:09,052 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 82, 1, 1, 1, 1, 1, 1] [2018-12-03 15:55:09,052 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:09,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:09,052 INFO L82 PathProgramCache]: Analyzing trace with hash 431949824, now seen corresponding path program 82 times [2018-12-03 15:55:09,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:09,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:09,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:09,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:11,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:11,869 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:11,869 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:11,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:11,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:11,870 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:11,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:11,878 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:11,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:12,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:19,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:19,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 15:55:19,580 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:19,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:55:19,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:55:19,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:55:19,582 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 85 states. [2018-12-03 15:55:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:19,843 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-12-03 15:55:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:55:19,843 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 334 [2018-12-03 15:55:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:19,844 INFO L225 Difference]: With dead ends: 341 [2018-12-03 15:55:19,844 INFO L226 Difference]: Without dead ends: 339 [2018-12-03 15:55:19,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:55:19,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-03 15:55:19,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-12-03 15:55:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-12-03 15:55:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-12-03 15:55:19,849 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 334 [2018-12-03 15:55:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:19,849 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-12-03 15:55:19,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:55:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-12-03 15:55:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-12-03 15:55:19,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:19,851 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 1, 1, 1, 1, 1, 1] [2018-12-03 15:55:19,851 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:19,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1967936938, now seen corresponding path program 83 times [2018-12-03 15:55:19,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:19,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:19,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:22,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:22,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:22,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:22,733 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:22,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:22,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:22,733 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:22,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:22,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 15:55:22,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:22,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:22,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:30,493 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:30,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:30,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 15:55:30,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:30,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:55:30,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:55:30,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:55:30,515 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 86 states. [2018-12-03 15:55:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:30,761 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-12-03 15:55:30,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:55:30,761 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 338 [2018-12-03 15:55:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:30,763 INFO L225 Difference]: With dead ends: 345 [2018-12-03 15:55:30,763 INFO L226 Difference]: Without dead ends: 343 [2018-12-03 15:55:30,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 759 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:55:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-03 15:55:30,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-12-03 15:55:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-12-03 15:55:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-12-03 15:55:30,768 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 338 [2018-12-03 15:55:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:30,768 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-12-03 15:55:30,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:55:30,768 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-12-03 15:55:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-12-03 15:55:30,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:30,770 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 1, 1, 1, 1, 1, 1] [2018-12-03 15:55:30,770 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:30,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:30,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2000241068, now seen corresponding path program 84 times [2018-12-03 15:55:30,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:30,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:30,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:30,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:30,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:33,708 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:33,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:33,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:33,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:33,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:33,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:33,709 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:33,718 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:33,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:33,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:33,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:33,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:33,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:41,748 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:41,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:41,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 15:55:41,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:41,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 15:55:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 15:55:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:55:41,769 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 87 states. [2018-12-03 15:55:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:42,203 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-12-03 15:55:42,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:55:42,203 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 342 [2018-12-03 15:55:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:42,205 INFO L225 Difference]: With dead ends: 349 [2018-12-03 15:55:42,205 INFO L226 Difference]: Without dead ends: 347 [2018-12-03 15:55:42,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 598 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:55:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-12-03 15:55:42,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-12-03 15:55:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-12-03 15:55:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-12-03 15:55:42,209 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 342 [2018-12-03 15:55:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:42,210 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-12-03 15:55:42,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 15:55:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-12-03 15:55:42,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-12-03 15:55:42,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:42,211 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 85, 1, 1, 1, 1, 1, 1] [2018-12-03 15:55:42,211 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:42,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:42,212 INFO L82 PathProgramCache]: Analyzing trace with hash 304660990, now seen corresponding path program 85 times [2018-12-03 15:55:42,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:42,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:42,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:42,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:42,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:45,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:45,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:45,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:45,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:45,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:45,063 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:45,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:45,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:45,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:45,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:53,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:53,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 15:55:53,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:53,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:55:53,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:55:53,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:55:53,465 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 88 states. [2018-12-03 15:55:53,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:53,894 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-12-03 15:55:53,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:55:53,894 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 346 [2018-12-03 15:55:53,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:53,896 INFO L225 Difference]: With dead ends: 353 [2018-12-03 15:55:53,897 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 15:55:53,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 605 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:55:53,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 15:55:53,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-12-03 15:55:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-12-03 15:55:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-12-03 15:55:53,901 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 346 [2018-12-03 15:55:53,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:53,901 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-12-03 15:55:53,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:55:53,901 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-12-03 15:55:53,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-12-03 15:55:53,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:53,903 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 86, 1, 1, 1, 1, 1, 1] [2018-12-03 15:55:53,903 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:53,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:53,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1311563944, now seen corresponding path program 86 times [2018-12-03 15:55:53,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:53,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:53,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:53,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:53,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:56,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:56,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:56,693 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:56,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:56,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:56,694 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:56,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:56,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:56,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 15:55:56,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:56,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:56,927 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:56,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:05,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:05,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 15:56:05,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:05,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 15:56:05,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 15:56:05,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:56:05,459 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 89 states. [2018-12-03 15:56:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:05,909 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-12-03 15:56:05,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:56:05,909 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 350 [2018-12-03 15:56:05,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:05,911 INFO L225 Difference]: With dead ends: 357 [2018-12-03 15:56:05,911 INFO L226 Difference]: Without dead ends: 355 [2018-12-03 15:56:05,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 786 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:56:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-12-03 15:56:05,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-12-03 15:56:05,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-03 15:56:05,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-12-03 15:56:05,916 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 350 [2018-12-03 15:56:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:05,916 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-12-03 15:56:05,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 15:56:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-12-03 15:56:05,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-12-03 15:56:05,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:05,918 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 87, 1, 1, 1, 1, 1, 1] [2018-12-03 15:56:05,918 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:05,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1739744686, now seen corresponding path program 87 times [2018-12-03 15:56:05,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:05,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:05,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:05,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:09,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:09,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:09,114 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:09,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:09,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:09,114 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:09,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:09,123 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:09,193 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:09,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:09,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:09,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:17,595 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:17,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:17,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 15:56:17,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:17,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 15:56:17,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 15:56:17,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:56:17,617 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 90 states. [2018-12-03 15:56:18,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:18,171 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-12-03 15:56:18,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:56:18,172 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 354 [2018-12-03 15:56:18,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:18,173 INFO L225 Difference]: With dead ends: 361 [2018-12-03 15:56:18,173 INFO L226 Difference]: Without dead ends: 359 [2018-12-03 15:56:18,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:56:18,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-12-03 15:56:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-12-03 15:56:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-03 15:56:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-12-03 15:56:18,176 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 354 [2018-12-03 15:56:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:18,177 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-12-03 15:56:18,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 15:56:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-12-03 15:56:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-12-03 15:56:18,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:18,178 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 88, 88, 1, 1, 1, 1, 1, 1] [2018-12-03 15:56:18,178 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:18,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash 180711164, now seen corresponding path program 88 times [2018-12-03 15:56:18,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:18,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:18,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:18,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:18,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:21,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:21,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:21,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:21,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,097 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:21,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:21,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:21,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:21,281 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:30,090 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:30,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 15:56:30,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:30,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 15:56:30,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 15:56:30,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 15:56:30,111 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 91 states. [2018-12-03 15:56:30,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:30,493 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-12-03 15:56:30,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:56:30,494 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 358 [2018-12-03 15:56:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:30,495 INFO L225 Difference]: With dead ends: 365 [2018-12-03 15:56:30,495 INFO L226 Difference]: Without dead ends: 363 [2018-12-03 15:56:30,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 626 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 15:56:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-12-03 15:56:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2018-12-03 15:56:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-12-03 15:56:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-12-03 15:56:30,500 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 358 [2018-12-03 15:56:30,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:30,500 INFO L480 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-12-03 15:56:30,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 15:56:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-12-03 15:56:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-12-03 15:56:30,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:30,501 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 89, 89, 1, 1, 1, 1, 1, 1] [2018-12-03 15:56:30,502 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:30,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:30,502 INFO L82 PathProgramCache]: Analyzing trace with hash 512679590, now seen corresponding path program 89 times [2018-12-03 15:56:30,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:30,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:30,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:30,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:30,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:33,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:33,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:33,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:33,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:33,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:33,541 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:33,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:33,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:33,699 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-03 15:56:33,699 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:33,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:33,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:42,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:42,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 15:56:42,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:42,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:56:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:56:42,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:56:42,530 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 92 states. [2018-12-03 15:56:42,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:42,810 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-12-03 15:56:42,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 15:56:42,811 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 362 [2018-12-03 15:56:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:42,813 INFO L225 Difference]: With dead ends: 369 [2018-12-03 15:56:42,813 INFO L226 Difference]: Without dead ends: 367 [2018-12-03 15:56:42,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 633 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:56:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-12-03 15:56:42,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2018-12-03 15:56:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-12-03 15:56:42,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-12-03 15:56:42,816 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 362 [2018-12-03 15:56:42,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:42,816 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-12-03 15:56:42,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:56:42,817 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-12-03 15:56:42,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-12-03 15:56:42,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:42,818 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 1, 1, 1, 1, 1, 1] [2018-12-03 15:56:42,818 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:42,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1264871760, now seen corresponding path program 90 times [2018-12-03 15:56:42,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:42,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:42,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:42,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:42,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:46,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:46,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:46,146 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:46,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:46,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:46,146 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:46,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:46,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:46,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:46,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:46,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:46,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:55,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:55,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 15:56:55,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:55,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 15:56:55,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 15:56:55,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:56:55,669 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 93 states. [2018-12-03 15:56:56,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:56,018 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-12-03 15:56:56,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 15:56:56,018 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 366 [2018-12-03 15:56:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:56,019 INFO L225 Difference]: With dead ends: 373 [2018-12-03 15:56:56,020 INFO L226 Difference]: Without dead ends: 371 [2018-12-03 15:56:56,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 640 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:56:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-12-03 15:56:56,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-12-03 15:56:56,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-12-03 15:56:56,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-12-03 15:56:56,023 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 366 [2018-12-03 15:56:56,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:56,023 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-12-03 15:56:56,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 15:56:56,024 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-12-03 15:56:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-12-03 15:56:56,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:56,025 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 91, 91, 1, 1, 1, 1, 1, 1] [2018-12-03 15:56:56,025 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:56,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:56,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1480552710, now seen corresponding path program 91 times [2018-12-03 15:56:56,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:56,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:56,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:56,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:56,027 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:59,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:59,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:59,506 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:59,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:59,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:59,506 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:59,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:59,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:59,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:59,708 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:59,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:08,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:08,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 15:57:08,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:08,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:57:08,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:57:08,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:57:08,980 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 94 states. [2018-12-03 15:57:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:09,516 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-12-03 15:57:09,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:57:09,517 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 370 [2018-12-03 15:57:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:09,518 INFO L225 Difference]: With dead ends: 377 [2018-12-03 15:57:09,518 INFO L226 Difference]: Without dead ends: 375 [2018-12-03 15:57:09,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:57:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-03 15:57:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2018-12-03 15:57:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-12-03 15:57:09,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-12-03 15:57:09,522 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 370 [2018-12-03 15:57:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:09,522 INFO L480 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-12-03 15:57:09,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:57:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-12-03 15:57:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-12-03 15:57:09,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:09,524 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 92, 92, 1, 1, 1, 1, 1, 1] [2018-12-03 15:57:09,524 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:09,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:09,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1998729308, now seen corresponding path program 92 times [2018-12-03 15:57:09,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:09,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:09,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:09,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:09,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:12,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:12,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:12,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:12,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:12,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:12,720 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:12,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:12,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:12,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-03 15:57:12,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:12,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:13,001 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:13,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:22,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:22,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 15:57:22,833 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:22,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 15:57:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 15:57:22,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:57:22,835 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 95 states. [2018-12-03 15:57:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:23,270 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-12-03 15:57:23,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 15:57:23,271 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 374 [2018-12-03 15:57:23,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:23,273 INFO L225 Difference]: With dead ends: 381 [2018-12-03 15:57:23,273 INFO L226 Difference]: Without dead ends: 379 [2018-12-03 15:57:23,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:57:23,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-12-03 15:57:23,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2018-12-03 15:57:23,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-12-03 15:57:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-12-03 15:57:23,278 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 374 [2018-12-03 15:57:23,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:23,279 INFO L480 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-12-03 15:57:23,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 15:57:23,279 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-12-03 15:57:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-12-03 15:57:23,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:23,280 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 93, 93, 1, 1, 1, 1, 1, 1] [2018-12-03 15:57:23,280 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:23,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:23,281 INFO L82 PathProgramCache]: Analyzing trace with hash 582396750, now seen corresponding path program 93 times [2018-12-03 15:57:23,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:23,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:23,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:23,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:23,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:23,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:27,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:27,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:27,049 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:27,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:27,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:27,049 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:27,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:27,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:27,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:27,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:27,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:27,254 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:27,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:37,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 15:57:37,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:37,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 15:57:37,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 15:57:37,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:57:37,266 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 96 states. [2018-12-03 15:57:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:37,586 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-12-03 15:57:37,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 15:57:37,587 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 378 [2018-12-03 15:57:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:37,589 INFO L225 Difference]: With dead ends: 385 [2018-12-03 15:57:37,589 INFO L226 Difference]: Without dead ends: 383 [2018-12-03 15:57:37,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 661 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:57:37,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-12-03 15:57:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2018-12-03 15:57:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-12-03 15:57:37,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-12-03 15:57:37,594 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 378 [2018-12-03 15:57:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:37,594 INFO L480 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-12-03 15:57:37,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 15:57:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-12-03 15:57:37,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-12-03 15:57:37,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:37,597 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 94, 94, 1, 1, 1, 1, 1, 1] [2018-12-03 15:57:37,597 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:37,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:37,597 INFO L82 PathProgramCache]: Analyzing trace with hash 671457784, now seen corresponding path program 94 times [2018-12-03 15:57:37,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:37,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:37,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:37,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:37,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:41,184 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:41,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:41,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:41,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:41,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:41,185 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:41,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:41,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:41,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:51,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 15:57:51,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:51,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 15:57:51,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 15:57:51,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:57:51,366 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 97 states. [2018-12-03 15:57:51,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:51,834 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-12-03 15:57:51,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:57:51,835 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 382 [2018-12-03 15:57:51,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:51,836 INFO L225 Difference]: With dead ends: 389 [2018-12-03 15:57:51,836 INFO L226 Difference]: Without dead ends: 387 [2018-12-03 15:57:51,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:57:51,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-12-03 15:57:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2018-12-03 15:57:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-03 15:57:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-12-03 15:57:51,840 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 382 [2018-12-03 15:57:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:51,840 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-12-03 15:57:51,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 15:57:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-12-03 15:57:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-12-03 15:57:51,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:51,842 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 95, 95, 1, 1, 1, 1, 1, 1] [2018-12-03 15:57:51,842 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:51,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1782920098, now seen corresponding path program 95 times [2018-12-03 15:57:51,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:51,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:51,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:55,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:55,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:55,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:55,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:55,222 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:55,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:55,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:55,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-03 15:57:55,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:55,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:55,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:05,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:05,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 15:58:05,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:05,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 15:58:05,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 15:58:05,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:58:05,775 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 98 states. [2018-12-03 15:58:06,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:06,364 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-12-03 15:58:06,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 15:58:06,364 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 386 [2018-12-03 15:58:06,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:06,366 INFO L225 Difference]: With dead ends: 393 [2018-12-03 15:58:06,367 INFO L226 Difference]: Without dead ends: 391 [2018-12-03 15:58:06,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 867 GetRequests, 675 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:58:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-12-03 15:58:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2018-12-03 15:58:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-12-03 15:58:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-12-03 15:58:06,371 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 386 [2018-12-03 15:58:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:06,371 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-12-03 15:58:06,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 15:58:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-12-03 15:58:06,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-12-03 15:58:06,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:06,373 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 96, 96, 1, 1, 1, 1, 1, 1] [2018-12-03 15:58:06,373 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:06,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:06,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2041569356, now seen corresponding path program 96 times [2018-12-03 15:58:06,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:06,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:06,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:06,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:06,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:09,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:09,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:09,742 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:09,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:09,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:09,742 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:09,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:09,752 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:09,830 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:09,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:09,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:09,943 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:09,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:20,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:20,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 15:58:20,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:20,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 15:58:20,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 15:58:20,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 15:58:20,378 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 99 states. [2018-12-03 15:58:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:20,973 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-12-03 15:58:20,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 15:58:20,974 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 390 [2018-12-03 15:58:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:20,975 INFO L225 Difference]: With dead ends: 397 [2018-12-03 15:58:20,975 INFO L226 Difference]: Without dead ends: 395 [2018-12-03 15:58:20,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 682 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 15:58:20,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-12-03 15:58:20,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-12-03 15:58:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-03 15:58:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-12-03 15:58:20,980 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 390 [2018-12-03 15:58:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:20,980 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-12-03 15:58:20,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 15:58:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-12-03 15:58:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-12-03 15:58:20,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:20,982 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 97, 97, 1, 1, 1, 1, 1, 1] [2018-12-03 15:58:20,982 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:20,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:20,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1161832438, now seen corresponding path program 97 times [2018-12-03 15:58:20,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:20,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:20,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:20,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:20,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:21,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:24,556 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:24,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:24,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:24,557 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:24,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:24,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:24,557 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:24,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:24,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:24,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:24,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:35,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:35,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 15:58:35,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:35,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 15:58:35,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 15:58:35,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:58:35,518 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 100 states. [2018-12-03 15:58:36,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:36,099 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-12-03 15:58:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 15:58:36,099 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 394 [2018-12-03 15:58:36,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:36,102 INFO L225 Difference]: With dead ends: 401 [2018-12-03 15:58:36,102 INFO L226 Difference]: Without dead ends: 399 [2018-12-03 15:58:36,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 885 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:58:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-12-03 15:58:36,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2018-12-03 15:58:36,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-03 15:58:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2018-12-03 15:58:36,106 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 394 [2018-12-03 15:58:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:36,106 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 399 transitions. [2018-12-03 15:58:36,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 15:58:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 399 transitions. [2018-12-03 15:58:36,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-12-03 15:58:36,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:36,108 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 98, 98, 1, 1, 1, 1, 1, 1] [2018-12-03 15:58:36,108 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:36,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1162835296, now seen corresponding path program 98 times [2018-12-03 15:58:36,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:36,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:36,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:36,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:36,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:39,836 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:39,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:39,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:39,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:39,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:39,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:39,836 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:39,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:39,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:40,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-03 15:58:40,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:40,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:40,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:51,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 15:58:51,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:51,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:58:51,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:58:51,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 15:58:51,066 INFO L87 Difference]: Start difference. First operand 399 states and 399 transitions. Second operand 101 states. [2018-12-03 15:58:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:51,777 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-12-03 15:58:51,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:58:51,777 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 398 [2018-12-03 15:58:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:51,779 INFO L225 Difference]: With dead ends: 405 [2018-12-03 15:58:51,779 INFO L226 Difference]: Without dead ends: 403 [2018-12-03 15:58:51,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 696 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 15:58:51,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-12-03 15:58:51,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2018-12-03 15:58:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-12-03 15:58:51,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-12-03 15:58:51,784 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 398 [2018-12-03 15:58:51,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:51,785 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-12-03 15:58:51,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:58:51,785 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-12-03 15:58:51,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-12-03 15:58:51,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:51,787 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 1, 1, 1, 1, 1, 1] [2018-12-03 15:58:51,787 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:51,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:51,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1719371850, now seen corresponding path program 99 times [2018-12-03 15:58:51,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:51,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:51,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:51,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:51,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:55,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:55,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:55,426 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:55,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:55,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:55,426 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:55,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:55,437 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:55,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:55,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:55,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:55,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:06,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:06,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 15:59:06,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:06,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:59:06,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:59:06,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:59:06,826 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 102 states. [2018-12-03 15:59:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:07,155 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-12-03 15:59:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:59:07,155 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 402 [2018-12-03 15:59:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:07,157 INFO L225 Difference]: With dead ends: 409 [2018-12-03 15:59:07,157 INFO L226 Difference]: Without dead ends: 407 [2018-12-03 15:59:07,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:59:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-12-03 15:59:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2018-12-03 15:59:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-12-03 15:59:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-12-03 15:59:07,163 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 402 [2018-12-03 15:59:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:07,164 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-12-03 15:59:07,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:59:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-12-03 15:59:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-12-03 15:59:07,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:07,166 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 100, 100, 1, 1, 1, 1, 1, 1] [2018-12-03 15:59:07,166 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:07,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:07,167 INFO L82 PathProgramCache]: Analyzing trace with hash 333160692, now seen corresponding path program 100 times [2018-12-03 15:59:07,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:07,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:07,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:07,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:07,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:10,999 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:10,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:10,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:10,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:10,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:11,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:11,000 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:11,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:11,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:11,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:11,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:22,880 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:22,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:22,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 15:59:22,900 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:22,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 15:59:22,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 15:59:22,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 15:59:22,902 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 103 states. [2018-12-03 15:59:23,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:23,463 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-12-03 15:59:23,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:59:23,463 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 406 [2018-12-03 15:59:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:23,466 INFO L225 Difference]: With dead ends: 413 [2018-12-03 15:59:23,466 INFO L226 Difference]: Without dead ends: 411 [2018-12-03 15:59:23,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 710 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 15:59:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-12-03 15:59:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2018-12-03 15:59:23,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-12-03 15:59:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-12-03 15:59:23,472 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 406 [2018-12-03 15:59:23,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:23,472 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-12-03 15:59:23,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 15:59:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-12-03 15:59:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-12-03 15:59:23,474 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:23,474 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 101, 101, 1, 1, 1, 1, 1, 1] [2018-12-03 15:59:23,474 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:23,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:23,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1825264798, now seen corresponding path program 101 times [2018-12-03 15:59:23,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:23,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:23,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:23,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:23,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:27,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:27,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:27,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:27,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:27,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:27,284 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:27,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:27,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:27,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 102 check-sat command(s) [2018-12-03 15:59:27,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:27,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:27,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:27,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:39,092 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:39,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:39,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 15:59:39,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:39,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 15:59:39,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 15:59:39,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:59:39,114 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 104 states. [2018-12-03 15:59:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:39,565 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-12-03 15:59:39,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 15:59:39,566 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 410 [2018-12-03 15:59:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:39,567 INFO L225 Difference]: With dead ends: 417 [2018-12-03 15:59:39,567 INFO L226 Difference]: Without dead ends: 415 [2018-12-03 15:59:39,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 921 GetRequests, 717 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:59:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-12-03 15:59:39,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2018-12-03 15:59:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-03 15:59:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 415 transitions. [2018-12-03 15:59:39,573 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 415 transitions. Word has length 410 [2018-12-03 15:59:39,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:39,573 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 415 transitions. [2018-12-03 15:59:39,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 15:59:39,573 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 415 transitions. [2018-12-03 15:59:39,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-12-03 15:59:39,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:39,575 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 102, 102, 1, 1, 1, 1, 1, 1] [2018-12-03 15:59:39,576 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:39,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:39,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1710939320, now seen corresponding path program 102 times [2018-12-03 15:59:39,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:39,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:39,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:39,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:39,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:43,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:43,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:43,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:43,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:43,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:43,797 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:43,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:43,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:43,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:43,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:43,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:44,032 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:44,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:55,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:55,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 15:59:55,669 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:55,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 15:59:55,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 15:59:55,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 15:59:55,671 INFO L87 Difference]: Start difference. First operand 415 states and 415 transitions. Second operand 105 states. [2018-12-03 15:59:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:56,160 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-12-03 15:59:56,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 15:59:56,160 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 414 [2018-12-03 15:59:56,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:56,161 INFO L225 Difference]: With dead ends: 421 [2018-12-03 15:59:56,161 INFO L226 Difference]: Without dead ends: 419 [2018-12-03 15:59:56,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 724 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 15:59:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-12-03 15:59:56,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2018-12-03 15:59:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-03 15:59:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 419 transitions. [2018-12-03 15:59:56,167 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 419 transitions. Word has length 414 [2018-12-03 15:59:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:56,167 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 419 transitions. [2018-12-03 15:59:56,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 15:59:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 419 transitions. [2018-12-03 15:59:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-12-03 15:59:56,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:56,170 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 103, 103, 1, 1, 1, 1, 1, 1] [2018-12-03 15:59:56,170 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:56,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:56,170 INFO L82 PathProgramCache]: Analyzing trace with hash -486306574, now seen corresponding path program 103 times [2018-12-03 15:59:56,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:56,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:56,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:56,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:56,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:00,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:00,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:00,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,365 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:00,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:00,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:00,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:12,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:12,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 16:00:12,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:12,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:00:12,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:00:12,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:00:12,567 INFO L87 Difference]: Start difference. First operand 419 states and 419 transitions. Second operand 106 states. [2018-12-03 16:00:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:13,352 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-12-03 16:00:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 16:00:13,352 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 418 [2018-12-03 16:00:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:13,353 INFO L225 Difference]: With dead ends: 425 [2018-12-03 16:00:13,353 INFO L226 Difference]: Without dead ends: 423 [2018-12-03 16:00:13,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 939 GetRequests, 731 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 16:00:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-03 16:00:13,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-12-03 16:00:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-03 16:00:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-12-03 16:00:13,358 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 418 [2018-12-03 16:00:13,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:13,358 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-12-03 16:00:13,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:00:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-12-03 16:00:13,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-12-03 16:00:13,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:13,360 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 104, 104, 1, 1, 1, 1, 1, 1] [2018-12-03 16:00:13,360 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:13,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:13,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1308692892, now seen corresponding path program 104 times [2018-12-03 16:00:13,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:13,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:13,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:17,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:17,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:17,582 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:17,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:17,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:17,582 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:17,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:17,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:17,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 105 check-sat command(s) [2018-12-03 16:00:17,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:17,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:17,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:30,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:30,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 16:00:30,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:30,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 16:00:30,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 16:00:30,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:00:30,161 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 107 states. [2018-12-03 16:00:30,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:30,976 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-12-03 16:00:30,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 16:00:30,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 422 [2018-12-03 16:00:30,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:30,978 INFO L225 Difference]: With dead ends: 429 [2018-12-03 16:00:30,978 INFO L226 Difference]: Without dead ends: 427 [2018-12-03 16:00:30,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 738 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:00:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-12-03 16:00:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2018-12-03 16:00:30,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-12-03 16:00:30,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2018-12-03 16:00:30,984 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 422 [2018-12-03 16:00:30,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:30,984 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2018-12-03 16:00:30,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 16:00:30,984 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2018-12-03 16:00:30,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-12-03 16:00:30,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:30,986 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 105, 105, 1, 1, 1, 1, 1, 1] [2018-12-03 16:00:30,987 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:30,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:30,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1073230150, now seen corresponding path program 105 times [2018-12-03 16:00:30,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:30,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:30,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:30,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:30,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:35,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:35,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:35,290 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:35,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:35,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:35,291 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:35,300 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:35,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:35,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:35,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:35,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:35,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:47,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:47,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 16:00:47,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:47,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:00:47,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:00:47,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:00:47,954 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 108 states. [2018-12-03 16:00:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:48,782 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-12-03 16:00:48,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 16:00:48,783 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 426 [2018-12-03 16:00:48,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:48,784 INFO L225 Difference]: With dead ends: 433 [2018-12-03 16:00:48,784 INFO L226 Difference]: Without dead ends: 431 [2018-12-03 16:00:48,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 957 GetRequests, 745 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 16:00:48,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-12-03 16:00:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-12-03 16:00:48,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-12-03 16:00:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-12-03 16:00:48,788 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 426 [2018-12-03 16:00:48,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:48,788 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-12-03 16:00:48,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:00:48,788 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-12-03 16:00:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-12-03 16:00:48,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:48,790 INFO L402 BasicCegarLoop]: trace histogram [106, 106, 106, 106, 1, 1, 1, 1, 1, 1] [2018-12-03 16:00:48,790 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:48,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:48,790 INFO L82 PathProgramCache]: Analyzing trace with hash 480472048, now seen corresponding path program 106 times [2018-12-03 16:00:48,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:48,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:48,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:48,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:48,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:53,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:53,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:53,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:53,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:53,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:53,290 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:53,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:53,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:53,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:53,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:06,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:06,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 16:01:06,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:06,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 16:01:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 16:01:06,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:01:06,230 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 109 states. [2018-12-03 16:01:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:06,845 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-12-03 16:01:06,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 16:01:06,846 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 430 [2018-12-03 16:01:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:06,847 INFO L225 Difference]: With dead ends: 437 [2018-12-03 16:01:06,847 INFO L226 Difference]: Without dead ends: 435 [2018-12-03 16:01:06,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 16:01:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2018-12-03 16:01:06,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2018-12-03 16:01:06,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-12-03 16:01:06,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2018-12-03 16:01:06,853 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 430 [2018-12-03 16:01:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:06,853 INFO L480 AbstractCegarLoop]: Abstraction has 435 states and 435 transitions. [2018-12-03 16:01:06,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 16:01:06,854 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 435 transitions. [2018-12-03 16:01:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-12-03 16:01:06,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:06,856 INFO L402 BasicCegarLoop]: trace histogram [107, 107, 107, 107, 1, 1, 1, 1, 1, 1] [2018-12-03 16:01:06,856 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:06,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash -427998822, now seen corresponding path program 107 times [2018-12-03 16:01:06,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:06,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:06,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:06,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:11,363 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:11,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:11,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:11,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:11,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:11,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:11,364 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:11,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:11,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:11,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 108 check-sat command(s) [2018-12-03 16:01:11,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:11,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:11,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:24,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:24,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 16:01:24,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:24,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 16:01:24,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 16:01:24,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:01:24,294 INFO L87 Difference]: Start difference. First operand 435 states and 435 transitions. Second operand 110 states. [2018-12-03 16:01:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:25,112 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-12-03 16:01:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 16:01:25,113 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 434 [2018-12-03 16:01:25,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:25,113 INFO L225 Difference]: With dead ends: 441 [2018-12-03 16:01:25,114 INFO L226 Difference]: Without dead ends: 439 [2018-12-03 16:01:25,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 975 GetRequests, 759 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:01:25,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-12-03 16:01:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2018-12-03 16:01:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-12-03 16:01:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 439 transitions. [2018-12-03 16:01:25,118 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 439 transitions. Word has length 434 [2018-12-03 16:01:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:25,118 INFO L480 AbstractCegarLoop]: Abstraction has 439 states and 439 transitions. [2018-12-03 16:01:25,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 16:01:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 439 transitions. [2018-12-03 16:01:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-12-03 16:01:25,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:25,120 INFO L402 BasicCegarLoop]: trace histogram [108, 108, 108, 108, 1, 1, 1, 1, 1, 1] [2018-12-03 16:01:25,120 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:25,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:25,121 INFO L82 PathProgramCache]: Analyzing trace with hash -557829564, now seen corresponding path program 108 times [2018-12-03 16:01:25,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:25,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:25,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:25,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:25,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:29,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:29,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:29,605 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:29,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:29,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:29,605 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:29,614 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:29,614 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:29,702 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:29,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:29,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:29,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:43,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:43,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 16:01:43,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:43,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 16:01:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 16:01:43,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:01:43,078 INFO L87 Difference]: Start difference. First operand 439 states and 439 transitions. Second operand 111 states. [2018-12-03 16:01:43,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:43,874 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-12-03 16:01:43,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 16:01:43,875 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 438 [2018-12-03 16:01:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:43,876 INFO L225 Difference]: With dead ends: 445 [2018-12-03 16:01:43,876 INFO L226 Difference]: Without dead ends: 443 [2018-12-03 16:01:43,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 766 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 16:01:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-12-03 16:01:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2018-12-03 16:01:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-12-03 16:01:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-12-03 16:01:43,881 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 438 [2018-12-03 16:01:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:43,881 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-12-03 16:01:43,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 16:01:43,881 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-12-03 16:01:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-12-03 16:01:43,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:43,883 INFO L402 BasicCegarLoop]: trace histogram [109, 109, 109, 109, 1, 1, 1, 1, 1, 1] [2018-12-03 16:01:43,883 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:43,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:43,883 INFO L82 PathProgramCache]: Analyzing trace with hash 627490286, now seen corresponding path program 109 times [2018-12-03 16:01:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:43,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:43,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:43,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:43,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:48,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:48,592 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:48,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:48,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:48,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:48,593 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:01:48,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:48,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:48,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:48,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:02:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:02,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:02:02,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 16:02:02,448 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:02:02,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:02:02,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:02:02,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:02:02,451 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 112 states. [2018-12-03 16:02:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:02:03,393 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-12-03 16:02:03,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 16:02:03,394 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 442 [2018-12-03 16:02:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:02:03,395 INFO L225 Difference]: With dead ends: 449 [2018-12-03 16:02:03,395 INFO L226 Difference]: Without dead ends: 447 [2018-12-03 16:02:03,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 993 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 16:02:03,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-12-03 16:02:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-12-03 16:02:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-03 16:02:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 447 transitions. [2018-12-03 16:02:03,400 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 447 transitions. Word has length 442 [2018-12-03 16:02:03,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:02:03,400 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 447 transitions. [2018-12-03 16:02:03,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:02:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 447 transitions. [2018-12-03 16:02:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-12-03 16:02:03,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:02:03,402 INFO L402 BasicCegarLoop]: trace histogram [110, 110, 110, 110, 1, 1, 1, 1, 1, 1] [2018-12-03 16:02:03,402 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:02:03,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:02:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1496016024, now seen corresponding path program 110 times [2018-12-03 16:02:03,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:02:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:03,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:02:03,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:02:03,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:02:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:08,078 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:08,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:08,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:08,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:08,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:08,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:08,078 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:02:08,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:02:08,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:02:08,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 111 check-sat command(s) [2018-12-03 16:02:08,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:08,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:08,434 INFO L316 TraceCheckSpWp]: Computing backward predicates...