java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:53:27,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:53:27,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:53:27,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:53:27,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:53:27,283 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:53:27,284 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:53:27,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:53:27,290 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:53:27,291 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:53:27,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:53:27,298 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:53:27,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:53:27,303 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:53:27,305 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:53:27,305 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:53:27,309 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:53:27,311 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:53:27,313 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:53:27,315 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:53:27,316 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:53:27,317 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:53:27,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:53:27,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:53:27,320 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:53:27,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:53:27,322 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:53:27,322 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:53:27,323 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:53:27,324 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:53:27,325 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:53:27,325 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:53:27,326 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:53:27,326 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:53:27,327 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:53:27,327 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:53:27,328 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:53:27,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:53:27,347 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:53:27,348 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:53:27,348 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:53:27,348 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:53:27,348 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:53:27,348 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:53:27,349 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:53:27,349 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:53:27,350 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:53:27,350 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:53:27,350 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:53:27,350 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:53:27,350 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:53:27,351 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:53:27,351 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:53:27,352 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:53:27,352 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:53:27,352 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:53:27,352 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:53:27,352 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:53:27,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:53:27,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:53:27,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:53:27,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:53:27,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:53:27,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:53:27,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:53:27,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:53:27,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:53:27,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:53:27,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:53:27,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:53:27,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:53:27,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:53:27,357 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:53:27,357 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:53:27,358 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:53:27,358 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:53:27,358 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:53:27,359 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:53:27,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:53:27,413 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:53:27,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:53:27,420 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:53:27,421 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:53:27,421 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-12-03 16:53:27,422 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-12-03 16:53:27,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:53:27,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:53:27,465 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:53:27,465 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:53:27,465 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:53:27,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/1) ... [2018-12-03 16:53:27,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/1) ... [2018-12-03 16:53:27,504 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:53:27,504 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:53:27,504 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:53:27,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:53:27,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:53:27,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:53:27,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:53:27,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/1) ... [2018-12-03 16:53:27,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/1) ... [2018-12-03 16:53:27,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/1) ... [2018-12-03 16:53:27,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/1) ... [2018-12-03 16:53:27,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/1) ... [2018-12-03 16:53:27,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/1) ... [2018-12-03 16:53:27,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/1) ... [2018-12-03 16:53:27,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:53:27,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:53:27,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:53:27,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:53:27,535 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (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 16:53:27,604 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 16:53:27,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 16:53:27,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 16:53:27,790 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:53:27,790 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:53:27,791 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:53:27 BoogieIcfgContainer [2018-12-03 16:53:27,791 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:53:27,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:53:27,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:53:27,796 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:53:27,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:53:27" (1/2) ... [2018-12-03 16:53:27,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c3901e and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:53:27, skipping insertion in model container [2018-12-03 16:53:27,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:53:27" (2/2) ... [2018-12-03 16:53:27,800 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-12-03 16:53:27,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:53:27,821 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:53:27,836 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:53:27,868 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:53:27,868 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:53:27,868 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:53:27,868 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:53:27,869 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:53:27,869 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:53:27,869 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:53:27,869 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:53:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:53:27,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:53:27,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:27,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:53:27,896 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:27,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:27,902 INFO L82 PathProgramCache]: Analyzing trace with hash 30208, now seen corresponding path program 1 times [2018-12-03 16:53:27,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:27,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:27,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:27,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:28,040 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 16:53:28,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:53:28,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:53:28,043 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:53:28,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:53:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:53:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:53:28,065 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:53:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:28,134 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-03 16:53:28,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:53:28,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:53:28,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:28,151 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:53:28,151 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:53:28,154 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 16:53:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:53:28,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:53:28,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:53:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-03 16:53:28,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 7 transitions. Word has length 3 [2018-12-03 16:53:28,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:28,191 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-03 16:53:28,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:53:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 7 transitions. [2018-12-03 16:53:28,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:53:28,192 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:28,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:53:28,192 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:28,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:28,193 INFO L82 PathProgramCache]: Analyzing trace with hash 929704, now seen corresponding path program 1 times [2018-12-03 16:53:28,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:28,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:28,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:28,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:28,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:28,255 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 16:53:28,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:28,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:28,259 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:53:28,261 INFO L205 CegarAbsIntRunner]: [0], [6], [13], [14] [2018-12-03 16:53:28,345 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:53:28,345 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:53:28,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:53:28,542 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 2 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:53:28,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:28,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:53:28,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:28,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 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 16:53:28,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:28,602 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:28,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:28,649 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 16:53:28,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:28,806 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 16:53:28,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:28,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:53:28,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:28,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:53:28,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:53:28,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:53:28,828 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 4 states. [2018-12-03 16:53:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:28,863 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2018-12-03 16:53:28,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:53:28,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:53:28,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:28,864 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:53:28,864 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:53:28,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:53:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:53:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:53:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:53:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-03 16:53:28,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2018-12-03 16:53:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:28,868 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-03 16:53:28,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:53:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-03 16:53:28,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:53:28,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:28,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:53:28,870 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:28,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:28,870 INFO L82 PathProgramCache]: Analyzing trace with hash 931626, now seen corresponding path program 1 times [2018-12-03 16:53:28,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:28,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:28,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:28,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:28,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:28,941 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 16:53:28,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:28,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:28,942 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:53:28,942 INFO L205 CegarAbsIntRunner]: [0], [8], [13], [14] [2018-12-03 16:53:28,943 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:53:28,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:53:28,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:53:28,967 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 2 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:53:28,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:28,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:53:28,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:28,982 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 16:53:28,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:28,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:28,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:29,002 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 16:53:29,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:29,065 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 16:53:29,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:29,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:53:29,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:29,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:53:29,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:53:29,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:53:29,085 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2018-12-03 16:53:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:29,126 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2018-12-03 16:53:29,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:53:29,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:53:29,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:29,128 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:53:29,128 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:53:29,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:53:29,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:53:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 16:53:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:53:29,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2018-12-03 16:53:29,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2018-12-03 16:53:29,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:29,132 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2018-12-03 16:53:29,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:53:29,132 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2018-12-03 16:53:29,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:53:29,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:29,133 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:53:29,133 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:29,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:29,133 INFO L82 PathProgramCache]: Analyzing trace with hash 28814080, now seen corresponding path program 2 times [2018-12-03 16:53:29,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:29,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:29,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:29,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:29,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:29,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:29,260 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:29,261 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:53:29,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:29,261 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 16:53:29,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:29,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:29,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:53:29,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:29,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:29,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:29,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:29,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:53:29,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:29,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:53:29,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:53:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:53:29,373 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 5 states. [2018-12-03 16:53:29,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:29,401 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-03 16:53:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:53:29,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:53:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:29,405 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:53:29,405 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:53:29,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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 16:53:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:53:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-03 16:53:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:53:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-12-03 16:53:29,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-12-03 16:53:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:29,410 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2018-12-03 16:53:29,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:53:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2018-12-03 16:53:29,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:53:29,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:29,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:53:29,411 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:29,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash 28816002, now seen corresponding path program 1 times [2018-12-03 16:53:29,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:29,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:29,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:29,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:29,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:29,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:29,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:29,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:29,612 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 16:53:29,612 INFO L205 CegarAbsIntRunner]: [0], [6], [8], [13], [14] [2018-12-03 16:53:29,613 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:53:29,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:53:29,676 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:53:29,677 INFO L272 AbstractInterpreter]: Visited 5 different actions 23 times. Merged at 4 different actions 9 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:53:29,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:29,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:53:29,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:29,708 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 16:53:29,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:29,720 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:29,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:29,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:29,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:29,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:29,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:53:29,831 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:29,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:53:29,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:53:29,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:53:29,832 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-12-03 16:53:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:29,915 INFO L93 Difference]: Finished difference Result 10 states and 15 transitions. [2018-12-03 16:53:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:53:29,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:53:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:29,917 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:53:29,917 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:53:29,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:53:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:53:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-03 16:53:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:53:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-12-03 16:53:29,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-12-03 16:53:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:29,928 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2018-12-03 16:53:29,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:53:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2018-12-03 16:53:29,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:53:29,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:29,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:53:29,929 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:29,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:29,933 INFO L82 PathProgramCache]: Analyzing trace with hash 28873662, now seen corresponding path program 2 times [2018-12-03 16:53:29,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:29,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:29,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:29,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:29,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:30,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:30,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:30,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:30,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:30,004 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:53:30,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:30,005 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 16:53:30,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:30,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:30,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:53:30,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:30,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:30,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:30,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:30,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:30,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:53:30,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:30,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:53:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:53:30,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:53:30,097 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 5 states. [2018-12-03 16:53:30,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:30,129 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2018-12-03 16:53:30,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:53:30,130 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:53:30,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:30,131 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:53:30,131 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:53:30,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:53:30,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:53:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-03 16:53:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:53:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-03 16:53:30,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 5 [2018-12-03 16:53:30,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:30,136 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-03 16:53:30,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:53:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-03 16:53:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:53:30,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:30,136 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:53:30,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:30,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash 28875584, now seen corresponding path program 2 times [2018-12-03 16:53:30,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:30,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:30,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:30,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:30,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:30,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:30,176 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:53:30,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:30,177 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 16:53:30,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:30,186 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:30,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:53:30,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:30,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:30,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:30,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:30,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:30,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:53:30,274 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:30,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:53:30,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:53:30,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:53:30,275 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 5 states. [2018-12-03 16:53:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:30,311 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2018-12-03 16:53:30,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:53:30,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:53:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:30,312 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:53:30,312 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:53:30,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:53:30,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:53:30,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2018-12-03 16:53:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:53:30,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 11 transitions. [2018-12-03 16:53:30,316 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 11 transitions. Word has length 5 [2018-12-03 16:53:30,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:30,316 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 11 transitions. [2018-12-03 16:53:30,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:53:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 11 transitions. [2018-12-03 16:53:30,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:53:30,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:30,317 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:53:30,317 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:30,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:30,318 INFO L82 PathProgramCache]: Analyzing trace with hash 893229736, now seen corresponding path program 3 times [2018-12-03 16:53:30,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:30,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:30,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:30,465 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 16:53:30,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:30,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:30,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:30,467 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:53:30,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:30,467 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 16:53:30,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:30,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:30,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:30,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:30,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:30,528 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 16:53:30,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:30,788 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 16:53:30,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:30,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:53:30,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:30,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:53:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:53:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:30,810 INFO L87 Difference]: Start difference. First operand 7 states and 11 transitions. Second operand 6 states. [2018-12-03 16:53:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:30,845 INFO L93 Difference]: Finished difference Result 13 states and 21 transitions. [2018-12-03 16:53:30,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:53:30,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:53:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:30,846 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:53:30,847 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:53:30,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:30,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:53:30,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-03 16:53:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:53:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 16:53:30,853 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-12-03 16:53:30,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:30,853 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 16:53:30,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:53:30,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 16:53:30,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:53:30,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:30,854 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 16:53:30,854 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:30,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:30,854 INFO L82 PathProgramCache]: Analyzing trace with hash 893231658, now seen corresponding path program 3 times [2018-12-03 16:53:30,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:30,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:30,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:30,914 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 16:53:30,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:30,915 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:30,915 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:30,916 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:53:30,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:30,916 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 16:53:30,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:30,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:30,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:30,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:30,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:30,956 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 16:53:30,956 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:31,032 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 16:53:31,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:31,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:53:31,052 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:31,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:53:31,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:53:31,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:31,053 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 6 states. [2018-12-03 16:53:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:31,095 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2018-12-03 16:53:31,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:53:31,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:53:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:31,097 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:53:31,097 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:53:31,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:31,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:53:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-03 16:53:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:53:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-03 16:53:31,102 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 6 [2018-12-03 16:53:31,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:31,103 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-03 16:53:31,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:53:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-03 16:53:31,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:53:31,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:31,103 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 16:53:31,104 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:31,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:31,104 INFO L82 PathProgramCache]: Analyzing trace with hash 893289318, now seen corresponding path program 4 times [2018-12-03 16:53:31,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:31,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:31,159 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 16:53:31,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:31,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:31,160 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:53:31,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,161 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 16:53:31,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:31,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:31,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:31,181 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 16:53:31,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:31,236 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 16:53:31,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:31,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:53:31,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:31,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:53:31,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:53:31,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:31,256 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 6 states. [2018-12-03 16:53:31,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:31,293 INFO L93 Difference]: Finished difference Result 13 states and 21 transitions. [2018-12-03 16:53:31,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:53:31,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:53:31,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:31,294 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:53:31,294 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:53:31,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:31,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:53:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2018-12-03 16:53:31,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:53:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 16:53:31,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-12-03 16:53:31,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:31,300 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 16:53:31,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:53:31,300 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 16:53:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:53:31,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:31,301 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 16:53:31,301 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:31,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:31,301 INFO L82 PathProgramCache]: Analyzing trace with hash 893291240, now seen corresponding path program 5 times [2018-12-03 16:53:31,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:31,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:31,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:31,350 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 16:53:31,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:31,351 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:31,351 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:53:31,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,352 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 16:53:31,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:31,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:31,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:53:31,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:31,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:31,378 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 16:53:31,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:31,496 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 16:53:31,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:31,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:53:31,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:31,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:53:31,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:53:31,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:31,520 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 6 states. [2018-12-03 16:53:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:31,549 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2018-12-03 16:53:31,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:53:31,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:53:31,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:31,550 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:53:31,550 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:53:31,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:31,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:53:31,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-12-03 16:53:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:53:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-03 16:53:31,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 6 [2018-12-03 16:53:31,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:31,556 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-03 16:53:31,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:53:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-03 16:53:31,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:53:31,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:31,557 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 16:53:31,557 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:31,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:31,558 INFO L82 PathProgramCache]: Analyzing trace with hash 895076778, now seen corresponding path program 6 times [2018-12-03 16:53:31,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:31,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:31,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:31,598 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 16:53:31,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:31,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:31,599 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:53:31,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,599 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 16:53:31,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:31,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:31,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:31,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:31,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:31,619 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 16:53:31,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:31,724 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 16:53:31,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:31,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:53:31,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:31,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:53:31,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:53:31,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:31,746 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 6 states. [2018-12-03 16:53:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:31,794 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 16:53:31,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:53:31,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:53:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:31,795 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:53:31,795 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:53:31,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:53:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-12-03 16:53:31,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:53:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 16:53:31,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 6 [2018-12-03 16:53:31,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:31,800 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 16:53:31,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:53:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 16:53:31,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:53:31,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:31,801 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 16:53:31,801 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:31,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:31,802 INFO L82 PathProgramCache]: Analyzing trace with hash 895078700, now seen corresponding path program 7 times [2018-12-03 16:53:31,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:31,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:31,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:31,888 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 16:53:31,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:31,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:31,889 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:53:31,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,889 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 16:53:31,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:31,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:31,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:31,908 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 16:53:31,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:31,982 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 16:53:32,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:32,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:53:32,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:32,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:53:32,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:53:32,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:32,003 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2018-12-03 16:53:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:32,025 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 16:53:32,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:53:32,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:53:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:32,027 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:53:32,027 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:53:32,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:32,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:53:32,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 16:53:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:53:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 16:53:32,033 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 6 [2018-12-03 16:53:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:32,034 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 16:53:32,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:53:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 16:53:32,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:53:32,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:32,035 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 16:53:32,035 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:32,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:32,035 INFO L82 PathProgramCache]: Analyzing trace with hash 895136360, now seen corresponding path program 8 times [2018-12-03 16:53:32,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:32,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:32,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:32,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:32,208 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 16:53:32,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:32,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:32,209 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:53:32,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,210 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 16:53:32,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:32,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:32,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:53:32,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:32,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:32,228 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 16:53:32,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:32,284 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 16:53:32,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:32,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:53:32,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:32,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:53:32,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:53:32,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:32,305 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 6 states. [2018-12-03 16:53:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:32,345 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-03 16:53:32,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:53:32,345 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:53:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:32,346 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:53:32,346 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:53:32,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 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 16:53:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:53:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-12-03 16:53:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:53:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 16:53:32,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 6 [2018-12-03 16:53:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:32,354 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 16:53:32,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:53:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 16:53:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:53:32,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:32,355 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:53:32,355 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:32,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:32,355 INFO L82 PathProgramCache]: Analyzing trace with hash 895138282, now seen corresponding path program 3 times [2018-12-03 16:53:32,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:32,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:32,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:32,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:32,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:32,396 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 16:53:32,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:32,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:32,397 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:53:32,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,398 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 16:53:32,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:32,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:32,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:32,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:32,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:32,416 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 16:53:32,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:32,542 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 16:53:32,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:32,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:53:32,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:32,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:53:32,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:53:32,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:32,564 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 6 states. [2018-12-03 16:53:32,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:32,587 INFO L93 Difference]: Finished difference Result 13 states and 21 transitions. [2018-12-03 16:53:32,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:53:32,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:53:32,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:32,588 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:53:32,588 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:53:32,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:53:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:53:32,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-12-03 16:53:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:53:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2018-12-03 16:53:32,594 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 6 [2018-12-03 16:53:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:32,595 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2018-12-03 16:53:32,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:53:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2018-12-03 16:53:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:32,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:32,595 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:53:32,595 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:32,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:32,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1920311296, now seen corresponding path program 4 times [2018-12-03 16:53:32,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:32,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:32,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:32,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:32,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:32,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:32,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:32,650 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:53:32,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,650 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 16:53:32,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:32,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:32,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:32,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:32,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:32,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:32,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:32,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:32,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:32,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:32,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:32,772 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 7 states. [2018-12-03 16:53:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:32,804 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 16:53:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:32,805 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:32,806 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:53:32,806 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:53:32,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:53:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-12-03 16:53:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:32,814 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 16:53:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:32,815 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:32,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:32,815 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:32,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:32,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:32,816 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 16:53:32,816 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:32,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:32,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1920313218, now seen corresponding path program 9 times [2018-12-03 16:53:32,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:32,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:32,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:32,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:32,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:32,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:32,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:32,898 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:53:32,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,899 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 16:53:32,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:32,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:32,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:32,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:32,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:32,926 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:32,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:33,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:33,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:33,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:33,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:33,038 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 16:53:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:33,191 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 16:53:33,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:33,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:33,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:33,192 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:53:33,192 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:53:33,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:53:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-03 16:53:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:53:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 16:53:33,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 7 [2018-12-03 16:53:33,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:33,198 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 16:53:33,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 16:53:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:33,198 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:33,198 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 16:53:33,198 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:33,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:33,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1920370878, now seen corresponding path program 10 times [2018-12-03 16:53:33,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:33,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:33,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:33,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:33,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:33,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:33,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:33,310 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:33,310 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:33,311 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:53:33,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:33,311 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 16:53:33,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:33,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:33,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:33,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:33,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:33,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:33,554 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:33,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:33,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:33,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:33,555 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 7 states. [2018-12-03 16:53:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:33,630 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 16:53:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:33,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:33,631 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:53:33,631 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:53:33,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:33,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:53:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-03 16:53:33,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:33,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:33,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 16:53:33,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:33,637 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:33,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:33,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:33,638 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 16:53:33,638 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:33,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:33,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1920372800, now seen corresponding path program 11 times [2018-12-03 16:53:33,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:33,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:33,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:33,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:33,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:33,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:33,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:33,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:33,698 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:53:33,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:33,698 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 16:53:33,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:33,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:33,711 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:53:33,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:33,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:33,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:33,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:33,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:33,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:33,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:33,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:33,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:33,832 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 16:53:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:33,862 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-03 16:53:33,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:33,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:33,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:33,863 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:53:33,863 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:53:33,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:53:33,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-12-03 16:53:33,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:53:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 16:53:33,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 7 [2018-12-03 16:53:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:33,868 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 16:53:33,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 16:53:33,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:33,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:33,869 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 16:53:33,869 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:33,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:33,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1922158338, now seen corresponding path program 12 times [2018-12-03 16:53:33,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:33,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:33,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:33,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:33,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:33,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:33,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:33,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:33,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 16:53:33,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:33,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 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 16:53:33,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:33,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:33,945 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:33,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:33,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:33,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:34,032 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:34,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:34,052 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:34,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:34,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:34,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:34,053 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 7 states. [2018-12-03 16:53:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:34,196 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 16:53:34,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:34,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:34,199 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:53:34,199 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:53:34,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:53:34,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-12-03 16:53:34,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:34,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 16:53:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:34,209 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:34,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:34,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:34,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:34,210 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 16:53:34,210 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:34,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:34,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1922160260, now seen corresponding path program 13 times [2018-12-03 16:53:34,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:34,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:34,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:34,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:34,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:34,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:34,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:34,278 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:53:34,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:34,278 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 16:53:34,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:34,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:34,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:34,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:34,438 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:34,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:34,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:34,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:34,439 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 16:53:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:34,465 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 16:53:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:34,471 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:34,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:34,472 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:53:34,472 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:53:34,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:53:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-03 16:53:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:53:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 16:53:34,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 7 [2018-12-03 16:53:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:34,479 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 16:53:34,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 16:53:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:34,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:34,480 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 16:53:34,480 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:34,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1922217920, now seen corresponding path program 14 times [2018-12-03 16:53:34,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:34,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:34,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:34,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:34,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:34,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:34,565 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:53:34,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:34,565 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 16:53:34,577 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:34,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:34,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:53:34,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:34,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:34,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:34,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:34,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:34,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:34,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:34,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:34,688 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 7 states. [2018-12-03 16:53:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:34,809 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 16:53:34,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:34,811 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:34,812 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:53:34,812 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:53:34,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:34,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:53:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-03 16:53:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:34,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:34,822 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 16:53:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:34,822 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:34,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:34,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:34,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:34,822 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 16:53:34,823 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:34,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:34,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1922219842, now seen corresponding path program 15 times [2018-12-03 16:53:34,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:34,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:34,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:34,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:34,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:34,877 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:34,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 16:53:34,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:34,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 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 16:53:34,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:34,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:34,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:34,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:34,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:35,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:35,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:35,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:35,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:35,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:35,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:35,007 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 16:53:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:35,076 INFO L93 Difference]: Finished difference Result 14 states and 23 transitions. [2018-12-03 16:53:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:35,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:35,077 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:53:35,077 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:53:35,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:53:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9. [2018-12-03 16:53:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:53:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 16:53:35,085 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 7 [2018-12-03 16:53:35,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:35,086 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 16:53:35,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 16:53:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:35,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:35,086 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 16:53:35,087 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:35,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:35,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1977569598, now seen corresponding path program 16 times [2018-12-03 16:53:35,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:35,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:35,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:35,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:35,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:35,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:35,167 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:53:35,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:35,167 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 16:53:35,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:35,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:35,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:35,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:35,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:35,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:35,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:35,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:35,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:35,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:35,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:35,273 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 7 states. [2018-12-03 16:53:35,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:35,422 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:53:35,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:35,425 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:35,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:35,426 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:53:35,426 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:53:35,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:53:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-03 16:53:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:35,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:35,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 7 [2018-12-03 16:53:35,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:35,441 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:35,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:35,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:35,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:35,441 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 16:53:35,444 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:35,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:35,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1977571520, now seen corresponding path program 17 times [2018-12-03 16:53:35,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:35,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:35,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:35,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:35,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:35,766 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:35,766 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:53:35,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:35,766 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 16:53:35,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:35,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:35,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:53:35,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:35,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:35,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:35,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:35,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:35,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:35,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:35,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:35,887 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 7 states. [2018-12-03 16:53:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:35,910 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 16:53:35,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:35,911 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:35,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:35,912 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:53:35,912 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:53:35,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:53:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-12-03 16:53:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:35,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 16:53:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:35,921 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:35,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:35,922 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:35,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:35,922 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 16:53:35,922 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:35,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1977629180, now seen corresponding path program 18 times [2018-12-03 16:53:35,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:35,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:35,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:36,049 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:36,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 16:53:36,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,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 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 16:53:36,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:36,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:36,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:36,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:36,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:36,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:36,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:36,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:36,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:36,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:36,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:36,429 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 16:53:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:36,507 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:53:36,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:36,508 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:36,508 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:53:36,508 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:53:36,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:53:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-03 16:53:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:36,518 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 7 [2018-12-03 16:53:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:36,519 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:36,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:36,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:36,520 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 16:53:36,520 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:36,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1977631102, now seen corresponding path program 19 times [2018-12-03 16:53:36,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:36,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:36,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:36,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:36,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:36,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:36,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 16:53:36,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,587 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 16:53:36,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:36,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:36,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:36,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:36,691 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:36,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:36,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:36,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:36,692 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 7 states. [2018-12-03 16:53:36,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:36,731 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 16:53:36,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:36,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:36,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:36,732 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:53:36,732 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:53:36,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:53:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2018-12-03 16:53:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:53:36,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 16:53:36,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 7 [2018-12-03 16:53:36,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:36,740 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 16:53:36,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:36,740 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 16:53:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:36,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:36,740 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-12-03 16:53:36,741 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:36,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:36,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1979416640, now seen corresponding path program 20 times [2018-12-03 16:53:36,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:36,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:36,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:36,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:36,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,774 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:36,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:36,775 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:53:36,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,775 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 16:53:36,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:36,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:36,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:53:36,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:36,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:36,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:36,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:36,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:36,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:36,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:36,875 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 7 states. [2018-12-03 16:53:36,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:36,913 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 16:53:36,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:36,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:36,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:36,914 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:53:36,914 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:53:36,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:53:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-12-03 16:53:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:36,923 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 7 [2018-12-03 16:53:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:36,923 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:36,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:36,923 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:36,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:36,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:36,924 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 16:53:36,924 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:36,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:36,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1979418562, now seen corresponding path program 21 times [2018-12-03 16:53:36,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:36,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:36,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:36,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:36,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:36,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:36,980 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:53:36,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,981 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 16:53:36,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:36,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:36,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:36,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:36,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:37,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:37,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:37,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:37,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:37,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:37,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:37,072 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 7 states. [2018-12-03 16:53:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:37,242 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 16:53:37,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:37,242 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:37,243 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:53:37,243 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:53:37,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:37,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:53:37,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 11. [2018-12-03 16:53:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:37,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:37,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 7 [2018-12-03 16:53:37,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:37,253 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:37,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:37,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:37,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:37,253 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2018-12-03 16:53:37,253 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:37,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:37,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1979476222, now seen corresponding path program 22 times [2018-12-03 16:53:37,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:37,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:37,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:37,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:37,296 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:37,297 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:53:37,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:37,297 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 16:53:37,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:37,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:37,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:37,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:37,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:37,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:37,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:37,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:37,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:37,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:37,419 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 7 states. [2018-12-03 16:53:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:37,448 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 16:53:37,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:37,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:37,450 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:53:37,450 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:53:37,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:53:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-12-03 16:53:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:37,459 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 7 [2018-12-03 16:53:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:37,459 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:37,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:53:37,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:37,460 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:53:37,460 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:37,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1979478144, now seen corresponding path program 4 times [2018-12-03 16:53:37,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:37,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:37,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:37,505 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:37,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:37,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:37,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:37,505 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:53:37,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:37,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 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 16:53:37,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:37,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:37,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:37,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:37,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:37,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:37,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:53:37,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:37,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:53:37,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:53:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:37,625 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 7 states. [2018-12-03 16:53:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:37,647 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2018-12-03 16:53:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:53:37,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:53:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:37,648 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:53:37,648 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:53:37,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:53:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:53:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 9. [2018-12-03 16:53:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:53:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2018-12-03 16:53:37,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 15 transitions. Word has length 7 [2018-12-03 16:53:37,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:37,657 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 15 transitions. [2018-12-03 16:53:37,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:53:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 15 transitions. [2018-12-03 16:53:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:37,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:37,658 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:53:37,658 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:37,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:37,659 INFO L82 PathProgramCache]: Analyzing trace with hash -599898712, now seen corresponding path program 5 times [2018-12-03 16:53:37,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:37,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:37,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:37,726 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 16:53:37,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:37,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:37,727 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:37,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 16:53:37,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:37,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 16:53:37,737 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:37,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:37,743 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:37,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:37,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:37,746 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 16:53:37,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:37,804 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 16:53:37,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:37,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:37,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:37,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:37,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:37,825 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand 8 states. [2018-12-03 16:53:37,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:37,855 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:37,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:37,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:37,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:37,856 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:37,856 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:37,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 16:53:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:37,871 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:37,871 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:37,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:37,871 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:37,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:37,872 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:37,872 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:37,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:37,872 INFO L82 PathProgramCache]: Analyzing trace with hash -599896790, now seen corresponding path program 23 times [2018-12-03 16:53:37,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:37,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:37,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:37,943 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 16:53:37,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:37,944 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:37,944 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:37,945 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:53:37,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:37,945 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 16:53:37,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:37,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:37,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:37,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:37,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:37,964 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 16:53:37,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:38,043 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 16:53:38,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:38,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:38,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:38,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:38,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:38,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:38,063 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:38,098 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:53:38,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:38,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:38,101 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:53:38,101 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:53:38,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:53:38,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-03 16:53:38,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:38,114 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 16:53:38,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:38,114 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:38,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:38,114 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:38,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:38,115 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:38,115 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:38,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash -599839130, now seen corresponding path program 24 times [2018-12-03 16:53:38,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:38,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:38,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:38,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:38,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:38,459 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 16:53:38,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:38,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:38,460 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:38,460 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:53:38,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:38,461 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 16:53:38,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:38,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:38,483 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:38,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:38,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:38,487 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 16:53:38,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:38,646 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 16:53:38,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:38,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:38,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:38,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:38,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:38,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:38,666 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 16:53:38,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:38,743 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:38,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:38,744 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:38,744 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:38,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 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 16:53:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 16:53:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:38,762 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:38,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:38,763 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:38,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:38,763 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:38,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:38,763 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:38,763 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:38,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash -599837208, now seen corresponding path program 25 times [2018-12-03 16:53:38,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:38,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:38,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:38,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:38,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:38,838 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 16:53:38,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:38,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:38,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:38,839 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:53:38,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:38,839 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 16:53:38,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:38,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:38,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:38,861 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 16:53:38,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:39,011 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 16:53:39,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:39,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:39,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:39,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:39,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:39,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:39,031 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:39,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:39,068 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:53:39,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:39,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:39,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:39,069 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:53:39,070 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:53:39,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:53:39,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2018-12-03 16:53:39,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:39,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-12-03 16:53:39,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:39,081 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:39,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:39,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:39,082 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:39,082 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:39,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:39,082 INFO L82 PathProgramCache]: Analyzing trace with hash -598051670, now seen corresponding path program 26 times [2018-12-03 16:53:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:39,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:39,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:39,199 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 16:53:39,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:39,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:39,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:39,200 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:53:39,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:39,200 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 16:53:39,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:39,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:39,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:39,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:39,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:39,229 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 16:53:39,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:39,288 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 16:53:39,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:39,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:39,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:39,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:39,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:39,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:39,309 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 8 states. [2018-12-03 16:53:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:39,339 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 16:53:39,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:39,339 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:39,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:39,340 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:53:39,340 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:53:39,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:53:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-12-03 16:53:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:39,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:39,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:39,353 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:39,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:39,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:39,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:39,353 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:39,354 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:39,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:39,354 INFO L82 PathProgramCache]: Analyzing trace with hash -598049748, now seen corresponding path program 27 times [2018-12-03 16:53:39,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:39,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:39,477 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 16:53:39,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:39,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:39,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:39,478 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:53:39,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:39,478 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 16:53:39,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:39,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:39,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:39,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:39,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:39,497 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 16:53:39,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:39,550 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 16:53:39,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:39,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:39,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:39,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:39,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:39,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:39,571 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:39,599 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 16:53:39,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:39,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:39,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:39,600 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:53:39,600 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:53:39,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:53:39,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-03 16:53:39,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:39,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 16:53:39,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:39,613 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:39,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:39,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:39,613 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:39,614 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:39,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:39,614 INFO L82 PathProgramCache]: Analyzing trace with hash -597992088, now seen corresponding path program 28 times [2018-12-03 16:53:39,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:39,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:39,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:39,695 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 16:53:39,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:39,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:39,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:39,696 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:53:39,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:39,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 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 16:53:39,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:39,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:39,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:39,728 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 16:53:39,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:39,823 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 16:53:39,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:39,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:39,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:39,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:39,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:39,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:39,843 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 16:53:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:39,936 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 16:53:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:39,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:39,937 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:53:39,937 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:53:39,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:39,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:53:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-03 16:53:39,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:39,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:39,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:39,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:39,951 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:39,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:39,951 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:39,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:39,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:39,951 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:39,952 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:39,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:39,952 INFO L82 PathProgramCache]: Analyzing trace with hash -597990166, now seen corresponding path program 29 times [2018-12-03 16:53:39,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:39,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:39,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:40,005 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 16:53:40,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:40,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:40,006 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:53:40,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,006 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 16:53:40,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:40,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:40,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:40,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:40,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:40,031 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 16:53:40,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:40,105 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 16:53:40,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:40,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:40,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:40,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:40,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:40,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:40,124 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:40,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:40,159 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 16:53:40,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:40,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:40,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:40,160 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:53:40,160 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:53:40,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:53:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-03 16:53:40,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:53:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 16:53:40,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 8 [2018-12-03 16:53:40,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:40,171 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 16:53:40,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 16:53:40,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:40,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:40,172 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:40,172 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:40,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:40,173 INFO L82 PathProgramCache]: Analyzing trace with hash -542640410, now seen corresponding path program 30 times [2018-12-03 16:53:40,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:40,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:40,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:40,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:40,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:40,229 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 16:53:40,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:40,229 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:40,229 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:53:40,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,229 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 16:53:40,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:40,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:40,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:40,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:40,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:40,246 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 16:53:40,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:40,345 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 16:53:40,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:40,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:40,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:40,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:40,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:40,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:40,365 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 8 states. [2018-12-03 16:53:40,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:40,399 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:40,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:40,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:40,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:40,400 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:40,400 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:40,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 16:53:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:40,415 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:40,416 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:40,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:40,416 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:40,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:40,416 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:40,417 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:40,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:40,417 INFO L82 PathProgramCache]: Analyzing trace with hash -542638488, now seen corresponding path program 31 times [2018-12-03 16:53:40,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:40,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:40,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:40,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:40,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:40,467 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 16:53:40,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:40,467 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:40,468 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:53:40,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,468 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 16:53:40,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:40,479 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:40,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:40,486 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 16:53:40,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:40,556 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 16:53:40,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:40,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:40,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:40,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:40,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:40,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:40,577 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:40,617 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:53:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:40,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:40,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:40,618 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:53:40,618 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:53:40,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:40,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:53:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-03 16:53:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:40,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 16:53:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:40,633 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:40,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:40,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:40,633 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:40,633 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:40,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash -542580828, now seen corresponding path program 32 times [2018-12-03 16:53:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:40,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:40,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:40,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:40,675 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 16:53:40,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:40,676 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:40,676 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:53:40,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,676 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 16:53:40,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:40,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:40,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:40,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:40,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:40,695 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 16:53:40,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:40,775 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 16:53:40,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:40,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:40,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:40,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:40,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:40,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:40,794 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 16:53:40,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:40,836 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:40,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:40,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:40,837 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:40,838 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:40,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 16:53:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:40,853 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:40,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:40,853 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:40,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:40,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:40,853 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:40,854 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:40,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash -542578906, now seen corresponding path program 33 times [2018-12-03 16:53:40,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:40,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:40,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:40,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:40,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:40,902 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 16:53:40,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:40,903 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:40,903 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:53:40,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:40,903 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 16:53:40,913 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:40,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:40,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:40,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:40,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:40,927 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 16:53:40,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:40,993 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 16:53:41,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:41,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:41,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:41,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:41,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:41,013 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:41,049 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:53:41,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:41,053 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:41,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:41,053 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:53:41,053 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:53:41,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:41,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:53:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2018-12-03 16:53:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:41,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-12-03 16:53:41,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:41,070 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:41,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:41,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:41,070 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:41,070 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:41,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:41,071 INFO L82 PathProgramCache]: Analyzing trace with hash -540793368, now seen corresponding path program 34 times [2018-12-03 16:53:41,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:41,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:41,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:41,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:41,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:41,269 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 16:53:41,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:41,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:41,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:41,270 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:53:41,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:41,270 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 16:53:41,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:41,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:41,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:41,289 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 16:53:41,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:41,335 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 16:53:41,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:41,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:41,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:41,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:41,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:41,355 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 8 states. [2018-12-03 16:53:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:41,498 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 16:53:41,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:41,499 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:41,499 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:53:41,499 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:53:41,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:41,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:53:41,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2018-12-03 16:53:41,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:41,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:41,516 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:41,516 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:41,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:41,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:41,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:41,517 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:41,517 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:41,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:41,517 INFO L82 PathProgramCache]: Analyzing trace with hash -540791446, now seen corresponding path program 35 times [2018-12-03 16:53:41,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:41,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:41,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:41,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:41,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:41,671 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 16:53:41,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:41,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:41,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:41,671 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:53:41,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:41,672 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 16:53:41,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:41,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:41,689 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:41,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:41,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:41,691 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 16:53:41,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:41,773 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 16:53:41,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:41,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:41,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:41,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:41,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:41,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:41,794 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:41,826 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 16:53:41,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:41,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:41,827 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:53:41,828 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:53:41,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:53:41,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-12-03 16:53:41,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:41,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:41,846 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 16:53:41,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:41,846 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:41,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:41,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:41,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:41,846 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:41,847 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:41,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:41,847 INFO L82 PathProgramCache]: Analyzing trace with hash -540733786, now seen corresponding path program 36 times [2018-12-03 16:53:41,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:41,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:41,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:41,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:41,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:42,395 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 16:53:42,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:42,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:42,395 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:42,395 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:53:42,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:42,396 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 16:53:42,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:42,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:42,408 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:42,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:42,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:42,411 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 16:53:42,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:42,514 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 16:53:42,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:42,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:42,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:42,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:42,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:42,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:42,534 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 16:53:42,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:42,565 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 16:53:42,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:42,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:42,566 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:53:42,566 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:53:42,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:53:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-03 16:53:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:42,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:42,586 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:42,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:42,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:42,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:42,587 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:42,587 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:42,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:42,588 INFO L82 PathProgramCache]: Analyzing trace with hash -540731864, now seen corresponding path program 37 times [2018-12-03 16:53:42,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:42,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:42,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:42,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:42,666 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 16:53:42,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:42,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:42,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:42,666 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:53:42,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:42,667 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 16:53:42,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:42,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:42,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:42,680 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 16:53:42,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:42,741 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 16:53:42,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:42,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:42,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:42,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:42,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:42,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:42,763 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:42,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:42,792 INFO L93 Difference]: Finished difference Result 16 states and 27 transitions. [2018-12-03 16:53:42,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:42,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:42,793 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:53:42,793 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:53:42,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:42,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:53:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-12-03 16:53:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:53:42,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 16:53:42,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 8 [2018-12-03 16:53:42,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:42,805 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 16:53:42,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 16:53:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:42,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:42,806 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:42,806 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:42,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1175108650, now seen corresponding path program 38 times [2018-12-03 16:53:42,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:42,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:42,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:42,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:42,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:42,858 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 16:53:42,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:42,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:42,859 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:42,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 16:53:42,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:42,860 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 16:53:42,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:42,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:42,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:42,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:42,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:42,877 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 16:53:42,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:43,040 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 16:53:43,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:43,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:43,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:43,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:43,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:43,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:43,061 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 8 states. [2018-12-03 16:53:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:43,113 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:53:43,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:43,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:43,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:43,113 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:53:43,113 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:53:43,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:53:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-12-03 16:53:43,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:43,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:43,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 16:53:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:43,134 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:43,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:43,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:43,134 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:43,135 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:43,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:43,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1175110572, now seen corresponding path program 39 times [2018-12-03 16:53:43,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:43,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:43,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:43,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:43,207 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 16:53:43,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:43,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:43,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:43,209 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:53:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:43,209 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 16:53:43,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:43,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:43,225 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:43,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:43,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:43,229 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 16:53:43,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:43,300 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 16:53:43,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:43,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:43,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:43,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:43,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:43,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:43,322 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 16:53:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:43,387 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:53:43,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:43,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:43,388 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:53:43,388 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:53:43,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:53:43,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-12-03 16:53:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:43,412 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:43,412 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:43,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:43,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:43,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:43,413 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:43,413 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:43,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:43,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1175168232, now seen corresponding path program 40 times [2018-12-03 16:53:43,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:43,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:43,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:43,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:43,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:43,509 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 16:53:43,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:43,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:43,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:43,510 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:53:43,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:43,510 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 16:53:43,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:43,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:43,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:43,526 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 16:53:43,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:43,623 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 16:53:43,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:43,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:43,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:43,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:43,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:43,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:43,643 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:43,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:43,741 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:43,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:43,742 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:43,742 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:43,742 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:43,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:43,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-03 16:53:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:43,767 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 16:53:43,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:43,767 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:43,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:43,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:43,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:43,768 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:43,768 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:43,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:43,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1175170154, now seen corresponding path program 41 times [2018-12-03 16:53:43,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:43,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:43,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:43,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:43,858 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 16:53:43,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:43,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:43,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:43,860 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:53:43,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:43,860 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 16:53:43,876 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:43,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:43,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:43,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:43,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:43,898 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 16:53:43,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:44,051 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 16:53:44,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:44,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:44,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:44,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:44,076 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 16:53:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:44,128 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:53:44,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:44,128 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:44,129 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:53:44,129 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:53:44,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:44,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:53:44,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2018-12-03 16:53:44,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:44,149 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 16:53:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:44,149 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:44,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:44,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:44,150 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:44,150 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:44,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1176955692, now seen corresponding path program 42 times [2018-12-03 16:53:44,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:44,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:44,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:44,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:44,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:44,204 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 16:53:44,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:44,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:44,205 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:53:44,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,205 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 16:53:44,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:44,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:44,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:44,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:44,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:44,222 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 16:53:44,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:44,281 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 16:53:44,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:44,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:44,300 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:44,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:44,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:44,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:44,301 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 16:53:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:44,353 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:53:44,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:44,353 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:44,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:44,354 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:53:44,354 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:53:44,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:44,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:53:44,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-12-03 16:53:44,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:44,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 16:53:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:44,376 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:44,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:44,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:44,376 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:44,376 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:44,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:44,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1176957614, now seen corresponding path program 43 times [2018-12-03 16:53:44,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:44,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:44,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:44,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:44,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:44,453 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 16:53:44,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:44,454 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:44,454 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:53:44,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,454 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 16:53:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:44,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:44,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:44,470 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 16:53:44,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:44,532 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 16:53:44,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:44,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:44,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:44,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:44,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:44,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:44,552 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 16:53:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:44,607 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:53:44,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:44,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:44,608 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:53:44,608 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:53:44,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:53:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-12-03 16:53:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:44,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:44,628 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:44,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:44,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:44,628 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:44,629 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:44,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1177015274, now seen corresponding path program 44 times [2018-12-03 16:53:44,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:44,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:44,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:44,702 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 16:53:44,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:44,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:44,702 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:53:44,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,703 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 16:53:44,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:44,712 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:44,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:44,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:44,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:44,720 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 16:53:44,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:44,790 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 16:53:44,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:44,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:44,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:44,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:44,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:44,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:44,811 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:44,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:44,865 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:44,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:44,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:44,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:44,866 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:44,866 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:44,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:44,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-03 16:53:44,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:44,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 16:53:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:44,889 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:44,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:44,889 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:44,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:44,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:44,890 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:44,890 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:44,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:44,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1177017196, now seen corresponding path program 45 times [2018-12-03 16:53:44,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:44,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:44,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:44,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:44,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:44,990 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 16:53:44,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:44,991 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:44,991 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:53:44,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:44,991 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 16:53:45,001 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:45,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:45,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:45,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:45,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:45,011 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 16:53:45,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:45,071 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 16:53:45,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:45,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:45,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:45,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:45,093 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 16:53:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:45,159 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:53:45,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:45,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:45,160 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:53:45,160 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:53:45,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:53:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 11. [2018-12-03 16:53:45,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:45,175 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 8 [2018-12-03 16:53:45,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:45,175 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:45,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:45,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:45,176 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:45,176 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:45,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1232366952, now seen corresponding path program 46 times [2018-12-03 16:53:45,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:45,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:45,223 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 16:53:45,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:45,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:45,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:45,223 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:53:45,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:45,224 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 16:53:45,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:45,234 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:45,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:45,242 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 16:53:45,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:45,304 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 16:53:45,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:45,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:45,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:45,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:45,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:45,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:45,326 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 8 states. [2018-12-03 16:53:45,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:45,385 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:53:45,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:45,385 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:45,386 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:53:45,386 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:53:45,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:45,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:53:45,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 16:53:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:45,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:45,411 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 16:53:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:45,411 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:45,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:45,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:45,412 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:45,412 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:45,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:45,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1232368874, now seen corresponding path program 47 times [2018-12-03 16:53:45,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:45,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:45,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:45,474 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 16:53:45,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:45,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:45,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:45,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 16:53:45,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:45,475 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 16:53:45,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:45,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:45,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:45,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:45,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:45,494 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 16:53:45,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:45,550 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 16:53:45,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:45,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:45,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:45,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:45,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:45,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:45,570 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 16:53:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:45,619 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:45,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:45,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:45,620 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:45,620 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:45,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2018-12-03 16:53:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:45,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:45,644 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:45,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:45,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:45,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:45,645 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:45,645 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:45,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:45,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1232426534, now seen corresponding path program 48 times [2018-12-03 16:53:45,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:45,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:45,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:45,728 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 16:53:45,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:45,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:45,729 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:45,729 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:53:45,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:45,729 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 16:53:45,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:45,737 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:45,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:45,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:45,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:45,746 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 16:53:45,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:45,813 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 16:53:45,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:45,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:45,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:45,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:45,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:45,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:45,833 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:45,906 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:53:45,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:45,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:45,907 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:53:45,907 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:53:45,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:53:45,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 16:53:45,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:45,930 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 16:53:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:45,930 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:45,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:45,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:45,930 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:45,931 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:45,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1232428456, now seen corresponding path program 49 times [2018-12-03 16:53:45,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:45,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:45,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:45,968 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 16:53:45,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:45,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:45,969 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:45,969 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:53:45,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:45,970 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 16:53:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:45,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:45,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:45,988 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 16:53:45,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:46,046 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 16:53:46,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:46,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:46,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:46,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:46,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:46,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:46,065 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 16:53:46,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:46,119 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:46,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:46,119 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:46,119 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:46,120 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:46,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-12-03 16:53:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:46,141 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 8 [2018-12-03 16:53:46,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:46,141 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:46,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:46,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:46,141 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:53:46,142 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:46,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:46,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1234213994, now seen corresponding path program 50 times [2018-12-03 16:53:46,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:46,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:46,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:46,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:46,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:46,192 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 16:53:46,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,192 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:46,192 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:46,192 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:53:46,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,193 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 16:53:46,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:46,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:46,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:46,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:46,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:46,208 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 16:53:46,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:46,284 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 16:53:46,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:46,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:46,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:46,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:46,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:46,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:46,304 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 8 states. [2018-12-03 16:53:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:46,350 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:53:46,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:46,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:46,351 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:53:46,351 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:53:46,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:53:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-12-03 16:53:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:46,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:46,378 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 16:53:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:46,378 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:46,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:46,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:46,379 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:46,379 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:46,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1234215916, now seen corresponding path program 51 times [2018-12-03 16:53:46,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:46,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:46,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:46,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:46,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:46,422 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 16:53:46,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:46,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:46,422 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:53:46,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,422 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 16:53:46,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:46,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:46,436 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:46,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:46,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:46,440 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 16:53:46,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:46,495 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 16:53:46,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:46,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:46,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:46,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:46,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:46,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:46,514 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 16:53:46,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:46,564 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:53:46,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:46,564 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:46,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:46,565 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:53:46,565 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:53:46,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:46,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:53:46,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-12-03 16:53:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:46,588 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 8 [2018-12-03 16:53:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:46,588 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:46,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:46,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:46,589 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:53:46,589 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:46,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:46,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1234273576, now seen corresponding path program 52 times [2018-12-03 16:53:46,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:46,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:46,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:46,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:46,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:46,673 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 16:53:46,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:46,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:46,674 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:53:46,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,674 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 16:53:46,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:46,683 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:46,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:46,689 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 16:53:46,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:46,737 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 16:53:46,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:46,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:46,756 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:46,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:46,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:46,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:46,756 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 8 states. [2018-12-03 16:53:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:46,797 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 16:53:46,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:46,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:46,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:46,797 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:53:46,797 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:53:46,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:53:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2018-12-03 16:53:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:46,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 8 [2018-12-03 16:53:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:46,823 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:46,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:53:46,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:46,823 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:53:46,823 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:46,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1234275498, now seen corresponding path program 5 times [2018-12-03 16:53:46,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:46,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:46,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:46,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:46,889 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 16:53:46,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:46,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:46,890 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:53:46,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,890 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 16:53:46,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:46,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:46,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:46,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:46,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:46,913 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 16:53:46,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:46,969 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 16:53:46,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:46,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:53:46,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:46,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:53:46,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:53:46,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:46,989 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 8 states. [2018-12-03 16:53:47,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:47,035 INFO L93 Difference]: Finished difference Result 17 states and 29 transitions. [2018-12-03 16:53:47,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:53:47,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:53:47,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:47,036 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:53:47,036 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:53:47,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:53:47,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:53:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 10. [2018-12-03 16:53:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:53:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2018-12-03 16:53:47,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 8 [2018-12-03 16:53:47,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:47,053 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2018-12-03 16:53:47,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:53:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2018-12-03 16:53:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:47,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:47,054 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:53:47,054 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:47,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:47,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1416997632, now seen corresponding path program 6 times [2018-12-03 16:53:47,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:47,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:47,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:47,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:47,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:47,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:47,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:47,122 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:53:47,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:47,122 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 16:53:47,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:47,135 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:47,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:47,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:47,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:47,145 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:47,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:47,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:47,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:47,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:47,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:47,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:47,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:47,243 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 9 states. [2018-12-03 16:53:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:47,356 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:53:47,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:47,356 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:47,357 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:53:47,357 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:53:47,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:53:47,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 16:53:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:47,408 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:47,408 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:47,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:47,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:47,409 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:53:47,409 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:47,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1416995710, now seen corresponding path program 53 times [2018-12-03 16:53:47,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:47,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:47,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:47,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:47,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:48,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:48,228 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:48,228 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:53:48,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:48,229 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 16:53:48,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:48,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:48,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:48,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:48,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:48,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:48,342 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:48,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:48,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:48,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:48,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:48,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:48,363 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:48,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:48,454 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:53:48,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:48,455 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:48,455 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:53:48,456 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:53:48,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:53:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 16:53:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:48,489 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:53:48,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:48,489 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:48,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:48,489 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:48,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:48,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:48,490 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:53:48,490 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:48,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:48,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1416938050, now seen corresponding path program 54 times [2018-12-03 16:53:48,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:48,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:48,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:48,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:48,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:48,549 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:48,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:48,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:48,550 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:53:48,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:48,550 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 16:53:48,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:48,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:48,565 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:48,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:48,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:48,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:48,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:48,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:48,700 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:53:48,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:48,807 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:53:48,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:48,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:48,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:48,808 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:53:48,808 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:53:48,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:53:48,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 16:53:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:48,848 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:48,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:48,848 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:48,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:48,848 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:48,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:48,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:48,848 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:48,848 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:48,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:48,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1416936128, now seen corresponding path program 55 times [2018-12-03 16:53:48,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:48,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:48,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:48,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:48,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:48,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:48,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:48,957 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:53:48,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:48,958 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 16:53:48,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:48,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:48,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:49,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:49,178 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:49,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:49,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:49,179 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:49,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:49,251 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:49,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:49,251 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:49,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:49,252 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:49,252 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:49,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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 16:53:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:49,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-12-03 16:53:49,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:49,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:49,279 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 16:53:49,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:49,279 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:49,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:49,280 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:49,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:49,280 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:53:49,280 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:49,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:49,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1415150590, now seen corresponding path program 56 times [2018-12-03 16:53:49,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:49,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:49,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:49,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:49,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:49,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:49,342 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:49,343 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:53:49,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:49,343 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 16:53:49,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:49,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:49,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:49,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:49,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:49,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:49,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:49,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:49,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:49,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:49,456 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 16:53:49,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:49,538 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:53:49,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:49,538 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:49,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:49,539 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:53:49,539 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:53:49,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:53:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 16:53:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:49,570 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:49,570 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:49,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:49,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:49,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:49,570 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:49,571 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:49,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:49,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1415148668, now seen corresponding path program 57 times [2018-12-03 16:53:49,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:49,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:49,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:49,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:49,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:49,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:49,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:49,775 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:53:49,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:49,775 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 16:53:49,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:49,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:49,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:49,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:49,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:49,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:49,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:49,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:49,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:49,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:49,876 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:49,961 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:53:49,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:49,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:49,962 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:53:49,962 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:53:49,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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 16:53:49,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:53:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 16:53:49,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:49,995 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:53:49,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:49,995 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:49,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:49,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:49,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:49,996 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:49,996 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:49,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:49,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1415091008, now seen corresponding path program 58 times [2018-12-03 16:53:49,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:49,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:49,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:49,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:50,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:50,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:50,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:50,080 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:53:50,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:50,080 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 16:53:50,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:50,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:50,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:50,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:50,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:50,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:50,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:50,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:50,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:50,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:50,237 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:53:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:50,326 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:53:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:50,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:50,327 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:53:50,327 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:53:50,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:53:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 16:53:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:50,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:50,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:50,361 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:50,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:50,361 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:50,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:50,361 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:50,362 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:50,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:50,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1415089086, now seen corresponding path program 59 times [2018-12-03 16:53:50,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:50,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:50,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:50,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:50,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:50,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:50,419 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:50,419 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:53:50,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:50,419 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 16:53:50,428 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:50,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:50,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:50,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:50,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:50,440 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:50,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:50,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:50,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:50,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:50,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:50,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:50,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:50,536 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:50,617 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:50,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:50,617 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:50,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:50,617 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:50,617 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:50,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:50,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2018-12-03 16:53:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:50,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 9 [2018-12-03 16:53:50,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:50,647 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:50,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:50,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:50,647 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:53:50,648 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:50,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1359739330, now seen corresponding path program 60 times [2018-12-03 16:53:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:50,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:50,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:50,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:50,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:50,733 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:50,734 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:53:50,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:50,734 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 16:53:50,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:50,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:50,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:50,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:50,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:50,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:52,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:52,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:52,115 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:52,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:52,116 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 9 states. [2018-12-03 16:53:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:52,210 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:52,210 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:52,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:52,211 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:52,211 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:52,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 16:53:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:52,247 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:52,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:52,248 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:52,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:52,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:52,248 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:52,248 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:52,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1359737408, now seen corresponding path program 61 times [2018-12-03 16:53:52,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:52,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:52,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:52,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:52,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:52,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:52,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:52,325 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:52,326 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:53:52,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:52,326 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 16:53:52,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:52,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:52,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:52,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:52,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:52,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:52,434 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:52,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:52,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:52,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:52,435 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:52,548 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:53:52,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:52,548 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:52,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:52,549 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:53:52,549 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:53:52,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:53:52,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 16:53:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:52,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:52,584 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:53:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:52,584 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:52,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:52,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:52,585 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:52,585 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:52,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:52,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1359679748, now seen corresponding path program 62 times [2018-12-03 16:53:52,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:52,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:52,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:52,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:53,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:53,074 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:53:53,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,074 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 16:53:53,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:53,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:53,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:53,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:53,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:53,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:53,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:53,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:53,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:53,184 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:53:53,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:53,267 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:53,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:53,268 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:53,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:53,268 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:53,268 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:53,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 16:53:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:53,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:53,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:53,307 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:53,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:53,307 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:53,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:53,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:53,307 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:53,307 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:53,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1359677826, now seen corresponding path program 63 times [2018-12-03 16:53:53,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:53,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:53,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:53,308 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:53,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:53,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:53,363 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:53:53,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,363 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 16:53:53,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:53,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:53,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:53,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:53,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:53,458 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:53,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:53,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:53,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:53,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:53,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:53,479 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:53,559 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:53:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:53,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:53,560 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:53:53,560 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:53:53,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:53,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:53:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-12-03 16:53:53,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:53,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 16:53:53,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:53,592 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:53,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:53,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:53,592 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:53,593 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:53,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:53,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1357892288, now seen corresponding path program 64 times [2018-12-03 16:53:53,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:53,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:53,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:53,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:53,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:53,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:53,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:53,650 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:53:53,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,650 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 16:53:53,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:53,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:53,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:53,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:53,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:53,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:53,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:53,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:53,772 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 16:53:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:53,859 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:53,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:53,860 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:53,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:53,860 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:53,860 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:53,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:53,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-12-03 16:53:53,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:53,897 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:53,898 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:53,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:53,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:53,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:53,898 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:53,898 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:53,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1357890366, now seen corresponding path program 65 times [2018-12-03 16:53:53,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:53,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:53,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:53,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:54,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:54,014 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:53:54,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,014 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 16:53:54,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:54,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:54,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:54,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:54,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:54,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:54,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:54,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:54,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:54,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:54,190 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:54,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:54,278 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:54,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:54,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:54,279 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:54,279 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:54,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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 16:53:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-12-03 16:53:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:54,317 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:53:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:54,317 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:54,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:54,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:54,317 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:54,318 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:54,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:54,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1357832706, now seen corresponding path program 66 times [2018-12-03 16:53:54,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:54,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:54,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:54,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:54,357 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:53:54,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,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 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 16:53:54,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:54,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:54,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:54,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:54,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:54,371 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:54,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:54,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:54,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:54,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:54,475 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:53:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:54,546 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:53:54,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:54,546 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:54,546 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:53:54,547 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:53:54,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:54,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:53:54,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-12-03 16:53:54,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:54,586 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:54,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:54,587 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:54,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:54,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:54,587 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:54,587 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:54,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:54,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1357830784, now seen corresponding path program 67 times [2018-12-03 16:53:54,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:54,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:54,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:54,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:54,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:54,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:54,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 16:53:54,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,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 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 16:53:54,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:54,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:54,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:54,667 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:54,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:54,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:54,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:54,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:54,773 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:54,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:54,855 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 16:53:54,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:54,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:54,856 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:53:54,856 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:53:54,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:53:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-12-03 16:53:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:53:54,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:53:54,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 9 [2018-12-03 16:53:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:54,884 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:53:54,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:53:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:54,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:54,884 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:53:54,885 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:54,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:54,885 INFO L82 PathProgramCache]: Analyzing trace with hash 358009730, now seen corresponding path program 68 times [2018-12-03 16:53:54,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:54,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:54,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:54,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:54,952 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:54,952 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:53:54,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:54,952 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 16:53:54,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:54,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:54,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:54,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:54,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:54,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:55,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:55,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:55,308 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:55,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:55,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:55,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:55,308 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 9 states. [2018-12-03 16:53:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:55,398 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:53:55,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:55,398 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:55,399 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:53:55,399 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:53:55,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:53:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 16:53:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:55,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:55,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:55,446 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:55,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:55,446 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:55,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:55,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:55,446 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:55,446 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:55,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:55,446 INFO L82 PathProgramCache]: Analyzing trace with hash 358011652, now seen corresponding path program 69 times [2018-12-03 16:53:55,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:55,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:55,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:55,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:55,502 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:55,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:55,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:55,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:55,502 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:53:55,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:55,503 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 16:53:55,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:55,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:55,515 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:55,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:55,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:55,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:55,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:55,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:55,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:55,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:55,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:55,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:55,606 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:55,709 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:53:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:55,709 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:55,710 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:53:55,710 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:53:55,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:53:55,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 16:53:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:55,751 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:53:55,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:55,751 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:55,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:55,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:55,751 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:55,751 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:55,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:55,752 INFO L82 PathProgramCache]: Analyzing trace with hash 358069312, now seen corresponding path program 70 times [2018-12-03 16:53:55,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:55,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:55,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:55,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:55,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:55,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:55,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:55,830 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:55,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:55,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:55,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 16:53:55,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:55,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:55,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:55,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:55,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:55,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:55,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:55,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:55,943 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:53:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:56,053 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:53:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:56,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:56,054 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:53:56,054 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:53:56,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:56,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:53:56,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 16:53:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:56,094 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:56,094 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:56,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:56,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:56,094 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:56,095 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:56,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash 358071234, now seen corresponding path program 71 times [2018-12-03 16:53:56,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:56,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:56,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:56,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:56,144 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:56,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:56,145 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:56,145 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:53:56,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:56,145 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 16:53:56,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:56,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:56,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:56,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:56,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:56,161 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:56,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:56,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:56,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:56,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:56,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:56,255 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:56,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:56,371 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:56,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:56,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:56,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:56,372 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:56,372 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:56,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:56,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-12-03 16:53:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:56,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 16:53:56,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:56,410 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:56,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:56,410 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:56,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:56,410 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:56,410 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:56,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash 359856772, now seen corresponding path program 72 times [2018-12-03 16:53:56,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:56,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:56,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:56,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:56,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:56,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:56,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:56,465 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:53:56,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:56,465 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 16:53:56,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:56,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:56,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:56,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:56,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:56,601 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:56,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:56,619 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:56,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:56,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:56,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:56,620 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 16:53:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:56,723 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:53:56,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:56,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:56,724 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:53:56,724 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:53:56,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:53:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 16:53:56,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:56,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:56,772 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:56,772 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:56,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:56,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:56,772 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:56,772 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:56,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash 359858694, now seen corresponding path program 73 times [2018-12-03 16:53:56,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:56,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:56,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:56,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:56,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:56,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:56,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:56,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:56,828 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:53:56,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:56,828 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 16:53:56,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:56,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:56,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:56,844 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:56,922 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:56,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:56,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:56,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:56,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:56,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:56,943 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:57,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:57,050 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:53:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:57,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:57,051 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:53:57,051 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:53:57,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:57,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:53:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 16:53:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:57,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:57,094 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:53:57,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:57,094 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:57,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:57,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:57,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:57,095 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:57,095 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:57,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:57,095 INFO L82 PathProgramCache]: Analyzing trace with hash 359916354, now seen corresponding path program 74 times [2018-12-03 16:53:57,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:57,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:57,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:57,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:57,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:57,152 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:57,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:57,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:57,153 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:53:57,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:57,153 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 16:53:57,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:57,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:57,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:57,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:57,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:57,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:57,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:57,267 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:57,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:57,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:57,267 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:53:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:57,366 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:53:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:57,367 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:57,367 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:53:57,367 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:53:57,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:53:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 16:53:57,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:57,409 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:57,410 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:57,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:57,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:57,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:57,410 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:57,411 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:57,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:57,411 INFO L82 PathProgramCache]: Analyzing trace with hash 359918276, now seen corresponding path program 75 times [2018-12-03 16:53:57,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:57,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:57,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:57,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:57,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:57,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:57,463 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:53:57,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:57,463 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 16:53:57,473 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:57,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:57,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:57,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:57,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:57,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:57,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:57,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:57,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:57,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:57,592 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:57,689 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:57,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:57,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:57,690 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:57,690 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:57,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:57,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2018-12-03 16:53:57,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:53:57,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:53:57,726 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 9 [2018-12-03 16:53:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:57,726 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:53:57,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:57,727 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:53:57,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:57,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:57,727 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:57,727 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:57,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:57,727 INFO L82 PathProgramCache]: Analyzing trace with hash 415268032, now seen corresponding path program 76 times [2018-12-03 16:53:57,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:57,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:57,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:57,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:57,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:57,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:57,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:57,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:57,781 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:53:57,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:57,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 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 16:53:57,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:57,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:57,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:57,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:57,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:57,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:57,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:57,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:57,898 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 9 states. [2018-12-03 16:53:57,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:57,995 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:57,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:57,996 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:57,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:57,996 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:57,996 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:57,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:57,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:58,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 16:53:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:58,044 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:58,045 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:58,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:58,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:58,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:58,045 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:58,045 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:58,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash 415269954, now seen corresponding path program 77 times [2018-12-03 16:53:58,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:58,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:58,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:58,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:58,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:58,100 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:58,101 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:58,101 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:53:58,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:58,101 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 16:53:58,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:58,110 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:58,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:58,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:58,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:58,200 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:58,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:58,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:58,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:58,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:58,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:58,220 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:58,309 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:53:58,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:58,312 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:58,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:58,312 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:53:58,312 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:53:58,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:53:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 16:53:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:58,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:58,358 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:53:58,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:58,358 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:58,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:58,359 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:58,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:58,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:58,359 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:58,359 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:58,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash 415327614, now seen corresponding path program 78 times [2018-12-03 16:53:58,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:58,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:58,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:58,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:58,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:58,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:58,410 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:53:58,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:58,410 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 16:53:58,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:58,419 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:58,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:58,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:58,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:58,427 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:58,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:58,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:58,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:58,533 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:53:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:58,648 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:53:58,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:58,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:58,649 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:53:58,649 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:53:58,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:58,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:53:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 16:53:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:58,695 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:58,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:58,695 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:58,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:58,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:58,696 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:58,696 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:58,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:58,696 INFO L82 PathProgramCache]: Analyzing trace with hash 415329536, now seen corresponding path program 79 times [2018-12-03 16:53:58,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:58,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:58,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:58,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:58,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:58,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:58,757 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:58,758 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:53:58,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:58,758 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 16:53:58,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:58,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:58,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:58,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:58,891 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:58,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:58,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:58,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:58,892 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:58,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:58,997 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:53:58,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:58,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:58,998 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:53:58,998 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:53:58,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:53:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 13. [2018-12-03 16:53:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:53:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:53:59,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 16:53:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:59,050 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:53:59,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:53:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:59,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:59,050 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:53:59,051 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:59,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:59,051 INFO L82 PathProgramCache]: Analyzing trace with hash 417115074, now seen corresponding path program 80 times [2018-12-03 16:53:59,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:59,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:59,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:59,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:59,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:59,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:59,198 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:59,198 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:53:59,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:59,198 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 16:53:59,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:59,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:59,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:53:59,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:59,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:59,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:59,415 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:59,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:59,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:59,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:59,416 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 16:53:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:59,511 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:59,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:59,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:59,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:59,511 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:59,512 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:59,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2018-12-03 16:53:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:53:59,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:53:59,556 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:53:59,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:59,556 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:53:59,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:53:59,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:59,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:59,557 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:59,557 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:59,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:59,557 INFO L82 PathProgramCache]: Analyzing trace with hash 417116996, now seen corresponding path program 81 times [2018-12-03 16:53:59,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:59,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:59,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:59,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:59,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:59,606 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:59,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:59,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:59,607 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:53:59,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:59,607 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 16:53:59,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:59,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:59,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:59,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:59,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:59,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:59,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:53:59,723 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:59,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:53:59,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:53:59,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:59,724 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:53:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:59,808 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:53:59,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:53:59,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:53:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:59,809 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:53:59,809 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:53:59,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:53:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:53:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2018-12-03 16:53:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:53:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:53:59,856 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:53:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:59,856 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:53:59,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:53:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:53:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:53:59,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:59,856 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:53:59,857 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:59,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:59,857 INFO L82 PathProgramCache]: Analyzing trace with hash 417174656, now seen corresponding path program 82 times [2018-12-03 16:53:59,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:59,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:59,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:59,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:59,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:59,916 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:59,916 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:59,916 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:53:59,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:59,916 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 16:53:59,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:59,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:59,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:59,932 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:59,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:00,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:00,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:00,031 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:00,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:00,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:00,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:00,032 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:54:00,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:00,121 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:54:00,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:00,121 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:00,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:00,122 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:54:00,122 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:54:00,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:54:00,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-12-03 16:54:00,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:00,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:00,169 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:54:00,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:00,169 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:00,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:00,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:00,169 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:54:00,170 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:00,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:00,170 INFO L82 PathProgramCache]: Analyzing trace with hash 417176578, now seen corresponding path program 83 times [2018-12-03 16:54:00,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:00,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:00,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:00,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:00,171 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:00,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:00,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:00,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:00,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:00,504 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:54:00,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:00,504 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 16:54:00,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:00,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:00,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:00,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:00,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:00,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:00,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:00,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:00,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:00,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:00,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:00,606 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:54:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:00,689 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2018-12-03 16:54:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:00,689 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:00,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:00,690 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:54:00,690 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:54:00,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:54:00,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-12-03 16:54:00,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:54:00,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:54:00,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 9 [2018-12-03 16:54:00,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:00,722 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:54:00,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:00,723 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:54:00,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:00,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:00,723 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:54:00,723 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:00,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:00,723 INFO L82 PathProgramCache]: Analyzing trace with hash 2068623038, now seen corresponding path program 84 times [2018-12-03 16:54:00,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:00,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:00,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:00,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:00,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:00,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:00,780 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:54:00,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:00,780 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 16:54:00,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:00,789 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:00,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:00,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:00,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:00,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:00,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:00,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:00,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:00,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:00,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:00,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:00,900 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 9 states. [2018-12-03 16:54:01,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:01,052 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:01,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:01,052 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:01,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:01,053 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:01,053 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:01,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:01,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:01,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 16:54:01,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:01,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:01,116 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:01,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:01,116 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:01,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:01,117 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:01,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:01,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:01,117 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:01,117 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:01,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:01,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2068624960, now seen corresponding path program 85 times [2018-12-03 16:54:01,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:01,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:01,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:01,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:01,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:01,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:01,193 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:01,194 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:54:01,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:01,194 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 16:54:01,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:01,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:01,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:01,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:01,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:01,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:01,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:01,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:01,299 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:01,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:01,444 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:01,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:01,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:01,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:01,445 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:01,445 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:01,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:01,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:01,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-12-03 16:54:01,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:01,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:01,501 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:54:01,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:01,501 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:01,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:01,502 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:01,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:01,502 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:01,502 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:01,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:01,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2068682620, now seen corresponding path program 86 times [2018-12-03 16:54:01,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:01,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:01,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:01,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:01,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:01,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:01,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 16:54:01,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:01,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 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 16:54:01,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:01,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:01,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:01,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:01,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:01,598 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:01,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:01,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:01,685 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:01,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:01,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:01,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:01,685 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:54:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:01,837 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:01,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:01,837 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:01,838 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:01,838 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:01,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:01,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 16:54:01,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:01,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:01,896 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:01,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:01,896 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:01,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:01,896 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:01,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:01,896 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:01,896 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:01,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2068684542, now seen corresponding path program 87 times [2018-12-03 16:54:01,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:01,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:01,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:01,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:01,947 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:01,947 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:01,947 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:54:01,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:01,947 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 16:54:01,955 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:01,956 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:01,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:01,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:01,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:01,963 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:02,038 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:02,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:02,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:02,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:02,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:02,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:02,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:02,059 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:02,203 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:02,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:02,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:02,204 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:02,204 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:02,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 14. [2018-12-03 16:54:02,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:54:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:54:02,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:54:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:02,262 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:54:02,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:54:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:02,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:02,262 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:02,262 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:02,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:02,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2070470080, now seen corresponding path program 88 times [2018-12-03 16:54:02,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:02,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:02,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:02,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:02,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:02,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:02,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:02,479 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:02,479 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:54:02,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:02,479 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 16:54:02,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:02,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:02,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:02,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:02,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:02,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:02,575 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:02,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:02,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:02,576 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:54:02,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:02,724 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:02,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:02,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:02,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:02,725 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:02,725 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:02,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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 16:54:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 16:54:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:02,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:02,790 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:02,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:02,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:02,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:02,790 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:02,790 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:02,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:02,791 INFO L82 PathProgramCache]: Analyzing trace with hash 2070472002, now seen corresponding path program 89 times [2018-12-03 16:54:02,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:02,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:02,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:02,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:02,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:02,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:02,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:02,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:02,848 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:02,848 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:54:02,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:02,848 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 16:54:02,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:02,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:02,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:02,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:02,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:02,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:02,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:02,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:02,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:02,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:02,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:02,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:02,971 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:03,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:03,119 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:03,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:03,120 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:03,120 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:03,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-12-03 16:54:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:03,177 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:54:03,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:03,177 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:03,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:03,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:03,178 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:03,178 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:03,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:03,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2070529662, now seen corresponding path program 90 times [2018-12-03 16:54:03,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:03,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:03,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:03,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:03,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:03,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:03,294 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:03,294 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:54:03,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:03,295 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 16:54:03,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:03,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:03,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:03,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:03,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:03,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:03,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:03,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:03,392 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:03,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:03,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:03,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:03,393 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:54:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:03,542 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:03,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:03,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:03,543 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:03,543 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:03,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:03,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:03,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 16:54:03,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:03,616 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:03,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:03,617 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:03,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:03,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:03,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:03,617 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:03,617 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:03,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:03,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2070531584, now seen corresponding path program 91 times [2018-12-03 16:54:03,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:03,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:03,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:03,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:03,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:03,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:03,693 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:03,693 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:54:03,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:03,693 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 16:54:03,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:03,703 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:03,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:03,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:03,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:03,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:03,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:03,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:03,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:03,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:03,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:03,820 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:03,974 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:03,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:03,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:03,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:03,975 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:03,975 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:03,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:03,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 13. [2018-12-03 16:54:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:54:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:54:04,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 16:54:04,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:04,022 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:54:04,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:04,022 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:54:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:04,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:04,022 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:04,023 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:04,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:04,023 INFO L82 PathProgramCache]: Analyzing trace with hash 2125881340, now seen corresponding path program 92 times [2018-12-03 16:54:04,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:04,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:04,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:04,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:04,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:04,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:04,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:04,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:04,094 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:54:04,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:04,095 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:54:04,109 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:04,109 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:04,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:04,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:04,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:04,116 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:04,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:04,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:04,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:04,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:04,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:04,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:04,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:04,307 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 16:54:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:04,459 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:04,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:04,460 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:04,460 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:04,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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 16:54:04,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:04,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 16:54:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:04,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:04,524 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:04,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:04,524 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:04,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:04,524 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:04,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:04,524 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:04,525 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:04,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2125883262, now seen corresponding path program 93 times [2018-12-03 16:54:04,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:04,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:04,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:04,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:04,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:04,822 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:04,823 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:54:04,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:04,823 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:54:04,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:04,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:04,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:04,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:04,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:04,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:04,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:04,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:04,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:04,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:04,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:04,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:04,939 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:05,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:05,087 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:05,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:05,088 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:05,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:05,088 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:05,088 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:05,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:05,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:05,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-12-03 16:54:05,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:05,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:05,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:54:05,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:05,152 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:05,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:05,152 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:05,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:05,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:05,152 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:05,152 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:05,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:05,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2125940922, now seen corresponding path program 94 times [2018-12-03 16:54:05,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:05,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:05,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:05,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:05,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:05,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:05,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:05,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:05,212 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:54:05,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:05,212 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:54:05,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:05,221 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:05,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:05,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:05,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:05,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:05,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:05,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:05,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:05,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:05,321 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:54:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:05,486 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:05,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:05,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:05,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:05,486 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:05,487 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:05,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:05,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 16:54:05,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:05,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:05,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:05,553 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:05,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:05,553 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:05,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:05,554 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:05,554 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:05,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:05,554 INFO L82 PathProgramCache]: Analyzing trace with hash 2125942844, now seen corresponding path program 95 times [2018-12-03 16:54:05,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:05,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:05,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:05,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:05,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:05,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:05,691 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:05,691 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:05,692 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:54:05,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:05,692 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:54:05,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:05,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:05,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:05,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:05,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:05,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:05,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:05,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:05,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:05,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:05,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:05,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:05,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:05,794 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:05,942 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:05,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:05,942 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:05,942 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:05,943 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:05,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:05,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 14. [2018-12-03 16:54:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:54:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:54:05,997 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:54:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:05,997 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:54:05,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:05,997 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:54:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:05,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:05,997 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:05,997 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:05,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:05,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2127728382, now seen corresponding path program 96 times [2018-12-03 16:54:05,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:05,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:05,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:05,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:05,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:06,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:06,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:06,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:06,056 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:06,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 16:54:06,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:06,056 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:54:06,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:06,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:06,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:06,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:06,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:06,072 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:06,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:06,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:06,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:06,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:06,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:06,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:06,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:06,198 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:54:06,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:06,347 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:06,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:06,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:06,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:06,348 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:06,348 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:06,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:06,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 16:54:06,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:06,417 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:06,417 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:06,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:06,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:06,418 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:06,418 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:06,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:06,418 INFO L82 PathProgramCache]: Analyzing trace with hash 2127730304, now seen corresponding path program 97 times [2018-12-03 16:54:06,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:06,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:06,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:06,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:06,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:06,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:06,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:06,488 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:06,488 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:54:06,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:06,488 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:54:06,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:06,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:06,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:06,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:06,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:06,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:06,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:06,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:06,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:06,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:06,663 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:06,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:06,806 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:06,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:06,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:06,807 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:06,807 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:06,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:06,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-12-03 16:54:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:06,871 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:54:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:06,871 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:06,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:06,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:06,871 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:06,871 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:06,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2127787964, now seen corresponding path program 98 times [2018-12-03 16:54:06,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:06,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:06,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:06,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:06,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:06,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:06,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:06,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:06,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:06,930 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:54:06,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:06,930 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:54:06,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:06,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:06,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:06,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:06,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:06,950 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:06,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:07,036 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:07,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:07,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:07,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:07,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:07,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:07,055 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:54:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:07,189 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:07,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:07,189 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:07,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:07,189 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:07,190 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:07,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:07,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:07,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 16:54:07,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:07,257 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:07,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:07,257 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:07,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:07,257 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:07,257 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:54:07,257 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:07,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:07,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2127789886, now seen corresponding path program 99 times [2018-12-03 16:54:07,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:07,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:07,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:07,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:07,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:07,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:07,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:07,503 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:54:07,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:07,504 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:54:07,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:07,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:07,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:07,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:07,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:07,522 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:07,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:07,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:07,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:07,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:07,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:07,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:07,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:07,601 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:07,743 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:07,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:07,744 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:07,744 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:07,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 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 16:54:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:07,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 12. [2018-12-03 16:54:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:54:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:54:07,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 9 [2018-12-03 16:54:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:07,789 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:54:07,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:07,789 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:54:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:07,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:07,789 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:07,790 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:07,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:07,790 INFO L82 PathProgramCache]: Analyzing trace with hash -451336896, now seen corresponding path program 100 times [2018-12-03 16:54:07,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:07,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:07,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:07,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:07,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:07,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:07,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:07,841 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:54:07,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:07,841 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:07,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:07,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:07,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:07,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:07,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:07,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:07,962 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:07,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:07,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:07,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:07,962 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 9 states. [2018-12-03 16:54:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:08,117 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:08,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:08,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:08,118 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:08,118 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:08,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:08,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 16:54:08,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:08,191 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:08,191 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:08,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:08,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:08,191 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:08,191 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:08,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:08,192 INFO L82 PathProgramCache]: Analyzing trace with hash -451334974, now seen corresponding path program 101 times [2018-12-03 16:54:08,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:08,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:08,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:08,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:08,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:08,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:08,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:08,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:08,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 16:54:08,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:08,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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:08,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:08,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:08,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:08,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:08,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:08,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:08,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:08,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:08,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:08,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:08,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:08,407 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:08,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:08,563 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:08,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:08,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:08,564 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:08,564 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:08,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:08,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:08,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-12-03 16:54:08,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:08,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:08,645 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:54:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:08,645 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:08,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:08,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:08,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:08,645 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:08,645 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:08,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:08,646 INFO L82 PathProgramCache]: Analyzing trace with hash -451277314, now seen corresponding path program 102 times [2018-12-03 16:54:08,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:08,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:08,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:08,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:08,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:08,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:08,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:08,729 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:08,729 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:54:08,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:08,730 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 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:08,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:08,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:08,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:08,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:08,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:08,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:08,845 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:08,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:08,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:08,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:08,866 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:54:09,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:09,043 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:09,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:09,044 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:09,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:09,044 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:09,044 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:09,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:09,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-12-03 16:54:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:09,115 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:09,115 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:09,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:09,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:09,116 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:09,116 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:09,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -451275392, now seen corresponding path program 103 times [2018-12-03 16:54:09,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:09,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:09,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:09,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:09,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:09,172 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:09,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:09,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:09,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:09,172 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:54:09,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:09,172 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:09,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:09,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:09,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:09,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:09,271 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:09,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:09,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:09,290 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:09,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:09,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:09,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:09,291 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:09,444 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:54:09,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:09,444 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:09,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:09,444 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:54:09,444 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:54:09,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:09,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:54:09,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-12-03 16:54:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:54:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:54:09,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:54:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:09,504 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:54:09,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:54:09,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:09,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:09,504 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:09,504 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:09,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:09,504 INFO L82 PathProgramCache]: Analyzing trace with hash -449489854, now seen corresponding path program 104 times [2018-12-03 16:54:09,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:09,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:09,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:09,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:09,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:09,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:09,554 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:09,555 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:54:09,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:09,555 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 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:09,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:09,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:09,573 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:09,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:09,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:09,575 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:09,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:09,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:09,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:09,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:09,726 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:09,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:09,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:09,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:09,727 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:54:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:09,887 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:09,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:09,887 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:09,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:09,888 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:09,888 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:09,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:09,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 16:54:09,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:09,964 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:09,964 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:09,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:09,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:09,964 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:09,965 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:09,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash -449487932, now seen corresponding path program 105 times [2018-12-03 16:54:09,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:09,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:09,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:09,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:09,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:10,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:10,018 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:10,018 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:54:10,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:10,019 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:10,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:10,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:10,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:10,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:10,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:10,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:10,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:10,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:10,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:10,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:10,143 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:10,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:10,302 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:10,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:10,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:10,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:10,302 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:10,303 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:10,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:10,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-12-03 16:54:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:10,374 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:54:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:10,374 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:10,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:10,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:10,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:10,374 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:10,375 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:10,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:10,375 INFO L82 PathProgramCache]: Analyzing trace with hash -449430272, now seen corresponding path program 106 times [2018-12-03 16:54:10,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:10,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:10,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:10,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:10,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:10,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:10,498 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:54:10,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:10,498 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 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:10,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:10,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:10,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:10,513 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:10,573 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:10,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:10,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:10,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:10,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:10,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:10,593 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:54:10,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:10,739 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:10,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:10,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:10,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:10,740 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:10,740 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:10,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-12-03 16:54:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:10,812 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:10,812 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:10,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:10,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:10,812 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:10,812 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:54:10,812 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:10,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash -449428350, now seen corresponding path program 107 times [2018-12-03 16:54:10,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:10,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:10,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:10,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:10,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:10,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:10,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:10,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 16:54:10,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:10,863 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 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:10,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:10,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:10,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:10,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:10,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:11,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:11,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:11,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:11,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:11,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:11,010 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:11,155 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:54:11,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:11,155 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:11,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:11,155 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:54:11,155 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:54:11,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:11,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:54:11,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-12-03 16:54:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:54:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:54:11,208 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 9 [2018-12-03 16:54:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:11,208 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:54:11,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:54:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:11,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:11,209 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-12-03 16:54:11,209 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:11,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash -394078594, now seen corresponding path program 108 times [2018-12-03 16:54:11,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:11,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:11,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:11,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:11,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:11,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:11,266 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:11,266 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:11,267 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:54:11,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:11,267 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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:11,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:11,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:11,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:11,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:11,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:11,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:11,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:11,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:11,381 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:11,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:11,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:11,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:11,382 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 9 states. [2018-12-03 16:54:11,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:11,529 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:54:11,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:11,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:11,529 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:54:11,530 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:54:11,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:11,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:54:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-12-03 16:54:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:11,600 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:11,601 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:11,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:11,601 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:11,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:11,601 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:11,601 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:11,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:11,601 INFO L82 PathProgramCache]: Analyzing trace with hash -394076672, now seen corresponding path program 109 times [2018-12-03 16:54:11,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:11,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:11,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:11,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:11,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:11,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:11,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:11,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:11,660 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:54:11,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:11,660 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 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:11,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:11,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:11,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:11,675 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:11,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:11,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:11,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:11,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:11,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:11,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:11,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:11,766 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:11,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:11,913 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:54:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:11,913 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:11,914 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:54:11,914 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:54:11,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:54:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2018-12-03 16:54:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:11,999 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:54:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:12,000 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:12,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:12,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:12,000 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:12,000 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:12,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash -394019012, now seen corresponding path program 110 times [2018-12-03 16:54:12,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:12,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:12,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:12,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:12,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:12,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:12,073 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:12,073 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:12,073 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:54:12,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:12,073 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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:12,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:12,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:12,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:12,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:12,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:12,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:12,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:12,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:12,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:12,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:12,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:12,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:12,388 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:54:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:12,572 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:54:12,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:12,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:12,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:12,573 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:54:12,573 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:54:12,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:54:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-12-03 16:54:12,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:12,652 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:12,653 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:12,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:12,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:12,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:12,653 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:54:12,653 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:12,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:12,653 INFO L82 PathProgramCache]: Analyzing trace with hash -394017090, now seen corresponding path program 111 times [2018-12-03 16:54:12,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:12,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:12,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:12,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:12,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:12,723 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:12,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:12,724 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:12,724 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:12,724 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:54:12,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:12,725 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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:12,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:12,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:12,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:12,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:12,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:12,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:12,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:12,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:12,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:12,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:12,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:12,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:12,828 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:12,975 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:54:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:12,975 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:12,976 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:54:12,976 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:54:12,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:54:13,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-12-03 16:54:13,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:54:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:54:13,045 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 9 [2018-12-03 16:54:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:13,045 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:54:13,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:54:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:13,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:13,046 INFO L402 BasicCegarLoop]: trace histogram [4, 2, 1, 1, 1] [2018-12-03 16:54:13,046 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:13,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:13,046 INFO L82 PathProgramCache]: Analyzing trace with hash -392231552, now seen corresponding path program 112 times [2018-12-03 16:54:13,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:13,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:13,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:13,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:13,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:13,104 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:13,104 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:54:13,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:13,104 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 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:13,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:13,114 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:13,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:13,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:13,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:13,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:13,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:13,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:13,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:13,221 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 9 states. [2018-12-03 16:54:13,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:13,352 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:54:13,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:13,353 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:13,353 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:54:13,353 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:54:13,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:54:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-12-03 16:54:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:13,436 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:13,436 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:13,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:13,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:13,437 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:54:13,437 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:13,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash -392229630, now seen corresponding path program 113 times [2018-12-03 16:54:13,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:13,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:13,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:13,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:13,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:13,507 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:13,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:13,508 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:13,508 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:54:13,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:13,508 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 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:13,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:13,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:13,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:54:13,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:13,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:13,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:13,623 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:13,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:13,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:13,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:13,623 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:13,745 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:54:13,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:13,745 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:13,745 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:54:13,745 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:54:13,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:54:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 16:54:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:13,824 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 9 [2018-12-03 16:54:13,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:13,824 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:13,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:13,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:13,825 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2018-12-03 16:54:13,825 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:13,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:13,825 INFO L82 PathProgramCache]: Analyzing trace with hash -392171970, now seen corresponding path program 114 times [2018-12-03 16:54:13,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:13,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:13,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:13,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:13,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:13,885 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:54:13,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:13,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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:13,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:13,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:13,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:13,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:13,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:13,901 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:14,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:14,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:14,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:14,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:14,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:14,004 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 9 states. [2018-12-03 16:54:14,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:14,125 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:54:14,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:14,125 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:14,126 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:54:14,126 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:54:14,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:54:14,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2018-12-03 16:54:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:14,206 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 9 [2018-12-03 16:54:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:14,206 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:14,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:14,207 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:54:14,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:14,207 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:54:14,207 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:14,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:14,208 INFO L82 PathProgramCache]: Analyzing trace with hash -392170048, now seen corresponding path program 6 times [2018-12-03 16:54:14,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:14,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:14,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:14,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:14,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:14,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:14,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:14,265 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:14,265 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:54:14,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:14,266 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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:14,275 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:14,275 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:14,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:14,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:14,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:14,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:14,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:14,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:54:14,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:14,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:54:14,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:54:14,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:14,397 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 9 states. [2018-12-03 16:54:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:14,507 INFO L93 Difference]: Finished difference Result 19 states and 33 transitions. [2018-12-03 16:54:14,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:54:14,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:54:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:14,508 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:54:14,508 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:54:14,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:54:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:54:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 11. [2018-12-03 16:54:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:54:14,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 19 transitions. [2018-12-03 16:54:14,560 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 19 transitions. Word has length 9 [2018-12-03 16:54:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:14,560 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 19 transitions. [2018-12-03 16:54:14,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:54:14,560 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 19 transitions. [2018-12-03 16:54:14,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:14,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:14,561 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 16:54:14,561 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:14,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:14,561 INFO L82 PathProgramCache]: Analyzing trace with hash -977260376, now seen corresponding path program 7 times [2018-12-03 16:54:14,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:14,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:14,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:14,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:14,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:14,672 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 16:54:14,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:14,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:14,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:14,673 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:54:14,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:14,673 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 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:14,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:14,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:14,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:14,691 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 16:54:14,691 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:14,796 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 16:54:14,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:14,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:14,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:14,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:14,816 INFO L87 Difference]: Start difference. First operand 11 states and 19 transitions. Second operand 10 states. [2018-12-03 16:54:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:15,221 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:54:15,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:15,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:15,223 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:54:15,223 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:54:15,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:54:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:54:15,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:15,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:15,396 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:15,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:15,397 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:15,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:15,397 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:15,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:15,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:15,397 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:54:15,397 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:15,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:15,398 INFO L82 PathProgramCache]: Analyzing trace with hash -977258454, now seen corresponding path program 115 times [2018-12-03 16:54:15,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:15,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:15,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:15,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:15,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:16,212 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 16:54:16,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:16,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:16,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:16,214 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:54:16,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:16,214 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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:16,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:16,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:16,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:16,237 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 16:54:16,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:16,353 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 16:54:16,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:16,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:16,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:16,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:16,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:16,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:16,374 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:16,591 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:16,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:16,591 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:16,592 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:16,592 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:16,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 16:54:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:16,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:16,687 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:16,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:16,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:16,688 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:54:16,688 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:16,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash -977200794, now seen corresponding path program 116 times [2018-12-03 16:54:16,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:16,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:16,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:16,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:16,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:16,760 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 16:54:16,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:16,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:16,761 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:16,761 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:54:16,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:16,761 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 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:16,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:16,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:16,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:16,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:16,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:16,780 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 16:54:16,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:16,865 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 16:54:16,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:16,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:16,885 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:16,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:16,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:16,886 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:17,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:17,121 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:54:17,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:17,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:17,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:17,122 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:54:17,122 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:54:17,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:54:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:54:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:17,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:17,216 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:17,216 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:17,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:17,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:17,216 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:17,217 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:17,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:17,217 INFO L82 PathProgramCache]: Analyzing trace with hash -977198872, now seen corresponding path program 117 times [2018-12-03 16:54:17,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:17,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:17,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:17,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:17,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:17,282 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 16:54:17,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:17,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:17,282 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:17,282 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:54:17,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:17,282 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 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:17,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:17,290 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:17,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:17,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:17,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:17,297 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 16:54:17,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:17,384 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 16:54:17,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:17,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:17,403 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:17,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:17,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:17,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:17,404 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:17,621 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:17,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:17,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:17,622 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:17,622 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:17,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:17,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 16:54:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:17,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:17,708 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:54:17,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:17,708 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:17,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:17,708 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:17,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:17,709 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:54:17,709 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:17,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:17,709 INFO L82 PathProgramCache]: Analyzing trace with hash -975413334, now seen corresponding path program 118 times [2018-12-03 16:54:17,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:17,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:17,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:17,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:18,601 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 16:54:18,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:18,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:18,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:18,601 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:54:18,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:18,602 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 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:18,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:18,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:18,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:18,622 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 16:54:18,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:18,713 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 16:54:18,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:18,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:18,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:18,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:18,732 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:54:18,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:18,946 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:18,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:18,946 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:18,947 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:18,947 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:18,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:18,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:19,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 16:54:19,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:19,045 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:19,045 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:19,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:19,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:19,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:19,045 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:19,046 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:19,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:19,046 INFO L82 PathProgramCache]: Analyzing trace with hash -975411412, now seen corresponding path program 119 times [2018-12-03 16:54:19,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:19,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:19,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:19,130 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 16:54:19,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:19,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:19,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:19,131 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:54:19,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:19,131 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 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:19,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:19,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:19,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:19,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:19,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:19,148 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 16:54:19,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:19,246 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 16:54:19,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:19,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:19,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:19,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:19,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:19,265 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:19,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:19,509 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:19,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:19,509 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:19,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:19,509 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:19,510 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:19,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 16:54:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:19,609 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:19,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:19,609 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:19,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:19,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:19,610 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:19,610 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:19,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:19,610 INFO L82 PathProgramCache]: Analyzing trace with hash -975353752, now seen corresponding path program 120 times [2018-12-03 16:54:19,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:19,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:19,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:19,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:19,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:19,706 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 16:54:19,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:19,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:19,707 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:19,707 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:54:19,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:19,707 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 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:19,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:19,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:19,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:19,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:19,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:19,723 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 16:54:19,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:19,916 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 16:54:19,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:19,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:19,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:19,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:19,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:19,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:19,935 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:20,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:20,151 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:20,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:20,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:20,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:20,152 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:20,152 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:20,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:54:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:20,255 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:20,255 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:20,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:20,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:20,256 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:20,256 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:20,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:20,256 INFO L82 PathProgramCache]: Analyzing trace with hash -975351830, now seen corresponding path program 121 times [2018-12-03 16:54:20,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:20,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:20,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:20,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:20,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:20,861 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 16:54:20,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:20,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:20,861 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:20,861 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:54:20,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:20,862 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 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:20,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:20,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:20,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:20,878 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 16:54:20,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:20,953 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 16:54:20,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:20,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:20,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:20,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:20,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:20,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:20,972 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:21,144 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:21,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:21,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:21,145 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:21,145 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:21,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:21,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-12-03 16:54:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:54:21,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:54:21,224 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 16:54:21,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:21,224 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:54:21,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:21,224 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:54:21,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:21,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:21,225 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:54:21,225 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:21,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:21,225 INFO L82 PathProgramCache]: Analyzing trace with hash -920002074, now seen corresponding path program 122 times [2018-12-03 16:54:21,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:21,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:21,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:21,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:21,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:21,288 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 16:54:21,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:21,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:21,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:21,288 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:54:21,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:21,289 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 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:21,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:21,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:21,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:21,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:21,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:21,307 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 16:54:21,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:21,480 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 16:54:21,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:21,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:21,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:21,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:21,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:21,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:21,499 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 16:54:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:21,716 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:54:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:21,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:21,717 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:54:21,717 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:54:21,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:21,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:54:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:54:21,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:21,812 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:21,812 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:21,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:21,813 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:21,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:21,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:21,813 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:21,813 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:21,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash -920000152, now seen corresponding path program 123 times [2018-12-03 16:54:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:21,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:21,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:21,881 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 16:54:21,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:21,882 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:21,882 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:21,882 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:54:21,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:21,882 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 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:21,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:21,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:21,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:21,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:21,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:21,899 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 16:54:21,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:21,996 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 16:54:22,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:22,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:22,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:22,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:22,015 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:22,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:22,261 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:22,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:22,263 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:22,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:22,263 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:22,263 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:22,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:22,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 16:54:22,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:22,359 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:22,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:22,359 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:22,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:22,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:22,360 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:22,360 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:22,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:22,360 INFO L82 PathProgramCache]: Analyzing trace with hash -919942492, now seen corresponding path program 124 times [2018-12-03 16:54:22,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:22,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:22,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:22,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:22,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:22,449 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 16:54:22,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:22,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:22,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:22,450 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:54:22,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:22,450 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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:22,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:22,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:22,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:22,467 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 16:54:22,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:22,567 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 16:54:22,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:22,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:22,586 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:22,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:22,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:22,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:22,587 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:22,805 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:54:22,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:22,805 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:22,805 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:54:22,806 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:54:22,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:54:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:54:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:22,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:22,904 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:22,904 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:22,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:22,904 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:22,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:22,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:22,905 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:22,905 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:22,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:22,905 INFO L82 PathProgramCache]: Analyzing trace with hash -919940570, now seen corresponding path program 125 times [2018-12-03 16:54:22,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:22,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:22,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:22,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:22,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:22,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:22,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:22,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:22,980 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:54:22,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:22,981 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 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:22,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:22,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:22,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:22,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:22,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:22,999 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:22,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:23,094 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 16:54:23,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:23,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:23,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:23,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:23,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:23,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:23,115 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:23,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:23,336 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:23,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:23,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:23,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:23,337 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:23,337 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:23,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:23,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:23,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 16:54:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:23,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:23,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:54:23,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:23,423 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:23,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:23,423 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:23,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:23,423 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:23,423 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:23,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:23,423 INFO L82 PathProgramCache]: Analyzing trace with hash -918155032, now seen corresponding path program 126 times [2018-12-03 16:54:23,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:23,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:23,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:23,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:23,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:23,485 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 16:54:23,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:23,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:23,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:23,486 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:54:23,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:23,486 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 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:23,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:23,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:23,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:23,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:23,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:23,502 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 16:54:23,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:23,606 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 16:54:23,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:23,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:23,625 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:23,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:23,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:23,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:23,626 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:54:23,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:23,834 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:23,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:23,834 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:23,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:23,835 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:23,835 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:23,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 16:54:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:23,939 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:23,939 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:23,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:23,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:23,940 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:23,940 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:23,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:23,940 INFO L82 PathProgramCache]: Analyzing trace with hash -918153110, now seen corresponding path program 127 times [2018-12-03 16:54:23,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:23,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:23,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:23,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:23,998 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 16:54:23,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:23,999 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:23,999 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:23,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 16:54:23,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:23,999 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 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:24,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:24,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:24,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:24,014 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 16:54:24,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:24,112 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 16:54:24,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:24,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:24,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:24,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:24,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:24,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:24,130 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:24,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:24,350 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:24,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:24,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:24,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:24,351 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:24,351 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:24,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:24,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 16:54:24,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:24,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:24,447 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:24,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:24,447 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:24,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:24,447 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:24,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:24,447 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:24,447 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:24,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:24,447 INFO L82 PathProgramCache]: Analyzing trace with hash -918095450, now seen corresponding path program 128 times [2018-12-03 16:54:24,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:24,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:24,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:24,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:24,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:24,517 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 16:54:24,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:24,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:24,517 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:24,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 16:54:24,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:24,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:24,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:24,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:24,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:24,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:24,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:24,533 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 16:54:24,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:24,651 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 16:54:24,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:24,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:24,670 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:24,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:24,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:24,671 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:24,863 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:24,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:24,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:24,864 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:24,864 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:24,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:24,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:54:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:24,973 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:24,973 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:24,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:24,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:24,974 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:24,974 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:24,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:24,974 INFO L82 PathProgramCache]: Analyzing trace with hash -918093528, now seen corresponding path program 129 times [2018-12-03 16:54:24,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:24,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:24,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:25,117 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 16:54:25,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:25,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:25,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:25,118 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:54:25,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:25,118 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 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:25,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:25,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:25,134 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:25,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:25,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:25,137 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 16:54:25,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:25,230 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 16:54:25,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:25,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:25,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:25,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:25,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:25,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:25,250 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:25,439 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:25,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:25,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:25,440 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:25,440 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:25,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:25,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2018-12-03 16:54:25,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:54:25,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:54:25,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 10 [2018-12-03 16:54:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:25,520 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:54:25,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:54:25,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:25,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:25,521 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:54:25,521 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:25,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:25,521 INFO L82 PathProgramCache]: Analyzing trace with hash 797746986, now seen corresponding path program 130 times [2018-12-03 16:54:25,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:25,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:25,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:25,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:25,720 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 16:54:25,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:25,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:25,720 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:25,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:25,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:25,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:25,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:25,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:25,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:25,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:25,740 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 16:54:25,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:25,854 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 16:54:25,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:25,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:25,873 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:25,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:25,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:25,874 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 10 states. [2018-12-03 16:54:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:26,131 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:26,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:26,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:26,132 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:26,132 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:26,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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 16:54:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:54:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:26,261 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:26,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:26,261 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:26,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:26,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:26,261 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:26,262 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:26,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:26,262 INFO L82 PathProgramCache]: Analyzing trace with hash 797748908, now seen corresponding path program 131 times [2018-12-03 16:54:26,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:26,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:26,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:26,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:26,323 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 16:54:26,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:26,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:26,323 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:26,324 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:54:26,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:26,324 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 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:26,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:26,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:26,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:26,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:26,339 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 16:54:26,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:26,430 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 16:54:26,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:26,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:26,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:26,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:26,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:26,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:26,450 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:26,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:26,654 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:26,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:26,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:26,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:26,656 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:26,656 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:26,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:26,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 16:54:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:26,767 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:26,767 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:26,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:26,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:26,768 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:26,768 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:26,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:26,768 INFO L82 PathProgramCache]: Analyzing trace with hash 797806568, now seen corresponding path program 132 times [2018-12-03 16:54:26,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:26,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:26,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:26,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:26,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:26,850 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 16:54:26,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:26,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:26,851 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:26,851 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:54:26,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:26,851 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 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:26,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:26,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:26,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:26,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:26,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:26,867 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 16:54:26,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:26,948 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 16:54:26,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:26,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:26,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:26,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:26,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:26,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:26,968 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:27,168 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:27,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:27,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:27,169 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:27,169 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:27,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:27,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 16:54:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:27,273 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:27,273 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:27,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:27,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:27,273 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:27,273 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:27,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:27,274 INFO L82 PathProgramCache]: Analyzing trace with hash 797808490, now seen corresponding path program 133 times [2018-12-03 16:54:27,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:27,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:27,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:27,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:27,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:27,334 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 16:54:27,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:27,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:27,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:27,334 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:54:27,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:27,335 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 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:27,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:27,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:27,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:27,350 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 16:54:27,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:27,460 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 16:54:27,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:27,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:27,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:27,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:27,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:27,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:27,479 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:27,668 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:27,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:27,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:27,668 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:27,668 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:27,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 16:54:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:27,771 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:54:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:27,771 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:27,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:27,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:27,771 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:27,772 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:27,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash 799594028, now seen corresponding path program 134 times [2018-12-03 16:54:27,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:27,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:27,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:27,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:27,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:27,835 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 16:54:27,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:27,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:27,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:27,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 16:54:27,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:27,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 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:27,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:27,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:27,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:27,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:27,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:27,852 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 16:54:27,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:27,938 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 16:54:27,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:27,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:27,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:27,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:27,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:27,958 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:54:28,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:28,166 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:28,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:28,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:28,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:28,167 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:28,167 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:28,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:54:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:28,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:28,283 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:28,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:28,283 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:28,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:28,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:28,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:28,284 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:28,284 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:28,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:28,284 INFO L82 PathProgramCache]: Analyzing trace with hash 799595950, now seen corresponding path program 135 times [2018-12-03 16:54:28,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:28,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:28,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:28,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:28,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:28,356 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 16:54:28,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:28,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:28,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:28,357 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:54:28,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:28,357 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 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:28,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:28,366 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:28,371 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:28,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:28,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:28,373 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 16:54:28,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:28,544 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 16:54:28,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:28,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:28,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:28,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:28,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:28,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:28,564 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:28,800 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:28,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:28,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:28,801 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:28,801 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:28,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 16:54:28,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:28,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:28,905 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:28,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:28,905 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:28,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:28,905 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:28,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:28,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:28,906 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:28,906 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:28,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash 799653610, now seen corresponding path program 136 times [2018-12-03 16:54:28,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:28,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:28,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:28,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:28,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:29,057 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 16:54:29,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:29,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:29,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:29,058 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:54:29,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:29,058 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 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:29,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:29,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:29,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:29,073 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 16:54:29,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:29,156 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 16:54:29,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:29,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:29,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:29,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:29,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:29,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:29,175 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:29,464 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:29,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:29,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:29,464 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:29,464 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:29,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:29,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:29,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 16:54:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:29,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:29,571 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:29,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:29,571 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:29,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:29,572 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:29,572 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:29,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:29,572 INFO L82 PathProgramCache]: Analyzing trace with hash 799655532, now seen corresponding path program 137 times [2018-12-03 16:54:29,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:29,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:29,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:29,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:29,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:29,684 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 16:54:29,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:29,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:29,685 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:29,685 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:54:29,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:29,685 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 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:29,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:29,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:29,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:29,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:29,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:29,704 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 16:54:29,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:30,065 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 16:54:30,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:30,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:30,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:30,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:30,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:30,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:30,085 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:30,278 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:30,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:30,279 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:30,279 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:30,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:30,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:30,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 16:54:30,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:54:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:54:30,367 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 16:54:30,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:30,367 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:54:30,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:30,367 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:54:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:30,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:30,368 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:30,368 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:30,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:30,368 INFO L82 PathProgramCache]: Analyzing trace with hash 855005288, now seen corresponding path program 138 times [2018-12-03 16:54:30,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:30,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:30,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:30,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:30,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:30,426 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 16:54:30,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:30,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:30,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:30,427 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:54:30,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:30,427 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 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:30,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:30,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:30,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:30,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:30,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:30,442 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 16:54:30,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:30,536 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 16:54:30,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:30,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:30,556 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:30,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:30,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:30,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:30,556 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 16:54:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:30,761 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:30,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:30,761 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:30,762 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:30,762 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:30,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:30,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 16:54:30,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:30,880 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:30,880 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:30,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:30,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:30,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:30,881 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:30,881 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:30,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:30,881 INFO L82 PathProgramCache]: Analyzing trace with hash 855007210, now seen corresponding path program 139 times [2018-12-03 16:54:30,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:30,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:30,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:30,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:30,882 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:30,971 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 16:54:30,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:30,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:30,972 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:30,972 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:54:30,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:30,972 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 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:30,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:30,980 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:30,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:30,987 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 16:54:30,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:31,075 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 16:54:31,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:31,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:31,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:31,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:31,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:31,094 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:31,296 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:54:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:31,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:31,297 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:54:31,297 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:54:31,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:54:31,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-12-03 16:54:31,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:31,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:31,405 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:31,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:31,405 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:31,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:31,405 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:31,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:31,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:31,405 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:31,405 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:31,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash 855064870, now seen corresponding path program 140 times [2018-12-03 16:54:31,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:31,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:31,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:31,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:31,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:31,471 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 16:54:31,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:31,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:31,472 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:31,472 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:54:31,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:31,472 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 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:31,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:31,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:31,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:31,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:31,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:31,489 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 16:54:31,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:31,573 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 16:54:31,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:31,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:31,592 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:31,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:31,592 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:31,808 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:31,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:31,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:31,809 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:31,809 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:31,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:31,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 16:54:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:31,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:31,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:31,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:31,927 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:31,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:31,927 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:31,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:31,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:31,927 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:31,927 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:31,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:31,927 INFO L82 PathProgramCache]: Analyzing trace with hash 855066792, now seen corresponding path program 141 times [2018-12-03 16:54:31,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:31,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:31,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:31,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:31,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:32,202 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 16:54:32,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:32,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:32,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:32,203 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:54:32,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:32,203 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 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:32,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:32,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:32,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:32,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:32,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:32,220 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 16:54:32,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:32,302 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 16:54:32,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:32,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:32,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:32,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:32,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:32,321 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:32,522 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:54:32,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:32,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:32,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:32,523 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:54:32,523 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:54:32,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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 16:54:32,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:54:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 16:54:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:32,622 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:54:32,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:32,623 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:32,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:32,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:32,623 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:32,623 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:32,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash 856852330, now seen corresponding path program 142 times [2018-12-03 16:54:32,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:32,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:32,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:32,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:32,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:32,777 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 16:54:32,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:32,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:32,778 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:32,778 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:54:32,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:32,778 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 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:32,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:32,786 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:32,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:32,791 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 16:54:32,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:32,901 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 16:54:32,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:32,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:32,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:32,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:32,919 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:54:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:33,110 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:54:33,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:33,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:33,111 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:54:33,111 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:54:33,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:54:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-12-03 16:54:33,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:33,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:33,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:33,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:33,237 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:33,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:33,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:33,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:33,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:33,238 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:33,238 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:33,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:33,238 INFO L82 PathProgramCache]: Analyzing trace with hash 856854252, now seen corresponding path program 143 times [2018-12-03 16:54:33,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:33,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:33,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:33,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:33,299 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 16:54:33,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:33,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:33,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:33,300 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:54:33,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:33,300 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 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:33,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:33,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:33,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:33,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:33,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:33,317 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 16:54:33,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:33,416 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 16:54:33,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:33,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:33,434 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:33,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:33,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:33,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:33,435 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:33,607 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:54:33,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:33,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:33,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:33,608 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:54:33,608 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:54:33,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:33,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:54:33,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-12-03 16:54:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:33,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:33,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:33,724 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:33,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:33,724 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:33,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:33,724 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:33,724 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:33,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:33,724 INFO L82 PathProgramCache]: Analyzing trace with hash 856911912, now seen corresponding path program 144 times [2018-12-03 16:54:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:33,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:33,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:33,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:33,786 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 16:54:33,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:33,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:33,786 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:33,786 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:54:33,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:33,787 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 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:33,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:33,794 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:33,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:33,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:33,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:33,801 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 16:54:33,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:33,939 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 16:54:33,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:33,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:33,960 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:33,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:33,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:33,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:33,960 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:34,120 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:54:34,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:34,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:34,120 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:54:34,120 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:54:34,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:54:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-03 16:54:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:34,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:34,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:34,231 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:34,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:34,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:34,231 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:34,232 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:34,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash 856913834, now seen corresponding path program 145 times [2018-12-03 16:54:34,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:34,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:34,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:34,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:34,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:34,336 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 16:54:34,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:34,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:34,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:34,337 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:54:34,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:34,337 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 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:34,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:34,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:34,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:34,352 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 16:54:34,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:34,468 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 16:54:34,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:34,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:34,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:34,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:34,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:34,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:34,486 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:34,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:34,644 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:54:34,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:34,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:34,645 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:54:34,645 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:54:34,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:34,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:54:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-12-03 16:54:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:54:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:54:34,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 10 [2018-12-03 16:54:34,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:34,727 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:54:34,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:54:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:34,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:34,728 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:54:34,728 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:34,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:34,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1786607002, now seen corresponding path program 146 times [2018-12-03 16:54:34,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:34,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:34,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:34,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:34,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:34,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:34,834 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 16:54:34,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:34,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:34,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:34,834 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:54:34,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:34,835 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 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:34,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:34,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:34,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:34,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:34,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:34,853 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 16:54:34,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:35,096 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 16:54:35,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:35,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:35,115 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:35,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:35,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:35,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:35,115 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 10 states. [2018-12-03 16:54:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:35,388 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:54:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:35,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:35,389 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:54:35,389 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:54:35,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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 16:54:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:54:35,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:54:35,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:35,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:35,519 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:35,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:35,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:35,520 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:35,520 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:35,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:35,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1786605080, now seen corresponding path program 147 times [2018-12-03 16:54:35,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:35,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:35,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:35,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:35,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:35,581 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 16:54:35,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:35,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:35,582 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:35,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:54:35,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:35,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 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:35,591 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:35,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:35,597 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:35,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:35,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:35,600 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 16:54:35,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:35,700 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 16:54:35,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:35,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:35,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:35,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:35,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:35,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:35,719 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:36,057 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:36,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:36,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:36,058 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:36,058 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:36,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:36,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 16:54:36,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:36,237 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:36,237 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:36,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:36,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:36,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:36,237 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:36,237 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:36,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:36,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1786547420, now seen corresponding path program 148 times [2018-12-03 16:54:36,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:36,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:36,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:36,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:36,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:36,343 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 16:54:36,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:36,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:36,343 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:36,343 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:54:36,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:36,343 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 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:36,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:36,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:36,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:36,360 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 16:54:36,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:36,442 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 16:54:36,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:36,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:36,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:36,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:36,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:36,462 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:36,757 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:54:36,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:36,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:36,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:36,757 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:54:36,758 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:54:36,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:36,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:54:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:54:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:36,889 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:36,889 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:36,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:36,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:36,890 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:36,890 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:36,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:36,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1786545498, now seen corresponding path program 149 times [2018-12-03 16:54:36,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:36,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:36,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:36,948 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 16:54:36,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:36,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:36,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:36,949 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:54:36,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:36,949 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 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:36,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:36,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:36,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:36,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:36,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:36,967 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 16:54:36,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:37,060 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 16:54:37,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:37,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:37,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:37,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:37,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:37,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:37,081 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:37,364 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:37,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:37,365 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:37,365 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:37,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 16:54:37,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:37,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:37,477 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:54:37,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:37,477 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:37,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:37,477 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:37,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:37,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:37,477 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:37,478 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:37,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:37,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1784759960, now seen corresponding path program 150 times [2018-12-03 16:54:37,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:37,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:37,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:37,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:37,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:37,537 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 16:54:37,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:37,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:37,537 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:37,537 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:54:37,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:37,537 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 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:37,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:37,546 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:37,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:37,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:37,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:37,553 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 16:54:37,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:37,644 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 16:54:37,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:37,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:37,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:37,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:37,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:37,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:37,665 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:54:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:37,921 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:37,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:37,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:37,922 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:37,922 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:37,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 16:54:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:38,052 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:38,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:38,052 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:38,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:38,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:38,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:38,052 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:38,053 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:38,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:38,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1784758038, now seen corresponding path program 151 times [2018-12-03 16:54:38,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:38,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:38,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:38,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:38,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:38,123 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 16:54:38,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:38,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:38,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:38,124 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:54:38,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:38,124 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 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:38,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:38,139 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:38,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:38,148 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 16:54:38,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:38,254 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 16:54:38,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:38,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:38,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:38,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:38,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:38,273 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:38,529 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:38,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:38,530 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:38,530 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:38,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:38,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 16:54:38,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:38,664 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:38,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:38,664 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:38,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:38,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:38,665 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:38,665 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:38,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:38,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1784700378, now seen corresponding path program 152 times [2018-12-03 16:54:38,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:38,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:38,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:38,666 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:38,752 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 16:54:38,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:38,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:38,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:38,753 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:54:38,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:38,753 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 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:38,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:38,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:38,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:38,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:38,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:38,770 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 16:54:38,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:38,857 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 16:54:38,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:38,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:38,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:38,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:38,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:38,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:38,877 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:39,133 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:39,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:39,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:39,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:39,134 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:39,134 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:39,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:54:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:39,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:39,271 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:39,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:39,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:39,271 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:39,271 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:39,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1784698456, now seen corresponding path program 153 times [2018-12-03 16:54:39,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:39,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:39,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:39,346 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 16:54:39,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:39,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:39,346 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:39,347 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:54:39,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:39,347 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 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:39,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:39,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:39,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:39,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:39,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:39,363 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 16:54:39,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:39,442 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 16:54:39,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:39,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:39,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:39,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:39,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:39,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:39,461 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:39,701 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:39,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:39,702 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:39,702 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:39,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:39,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2018-12-03 16:54:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:54:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:54:39,806 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 16:54:39,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:39,807 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:54:39,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:39,807 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:54:39,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:39,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:39,807 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:39,807 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:39,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:39,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1729348700, now seen corresponding path program 154 times [2018-12-03 16:54:39,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:39,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:39,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:39,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:39,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:39,866 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 16:54:39,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:39,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:39,866 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:39,866 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:54:39,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:39,867 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 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:39,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:39,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:39,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:39,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:39,884 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 16:54:39,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:39,991 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 16:54:40,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:40,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:40,011 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:40,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:40,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:40,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:40,011 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 16:54:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:40,280 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:54:40,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:40,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:40,281 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:54:40,281 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:54:40,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:40,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:54:40,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:54:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:40,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:40,414 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:40,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:40,414 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:40,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:40,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:40,414 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:40,414 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:40,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1729346778, now seen corresponding path program 155 times [2018-12-03 16:54:40,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:40,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:40,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:40,486 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 16:54:40,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:40,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:40,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:40,487 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:54:40,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:40,487 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 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:40,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:40,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:40,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:40,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:40,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:40,503 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 16:54:40,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:40,589 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 16:54:40,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:40,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:40,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:40,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:40,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:40,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:40,608 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:40,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:40,876 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:40,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:40,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:40,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:40,876 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:40,877 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:40,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:40,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:41,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 16:54:41,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:41,006 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:41,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:41,006 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:41,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:41,007 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:41,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:41,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:41,007 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:41,007 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:41,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:41,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1729289118, now seen corresponding path program 156 times [2018-12-03 16:54:41,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:41,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:41,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:41,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:41,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:41,069 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 16:54:41,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:41,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:41,070 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:41,070 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:54:41,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:41,070 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 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:41,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:41,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:41,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:41,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:41,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:41,087 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 16:54:41,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:41,187 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 16:54:41,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:41,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:41,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:41,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:41,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:41,207 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:41,490 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:54:41,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:41,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:41,491 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:54:41,491 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:54:41,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:41,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:54:41,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:54:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:41,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:41,635 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:41,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:41,635 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:41,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:41,635 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:41,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:41,636 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:41,636 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:41,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:41,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1729287196, now seen corresponding path program 157 times [2018-12-03 16:54:41,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:41,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:41,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:41,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:41,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:41,702 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 16:54:41,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:41,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:41,703 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:41,703 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:54:41,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:41,703 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 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:41,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:41,712 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:41,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:41,719 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 16:54:41,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:41,820 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 16:54:41,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:41,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:41,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:41,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:41,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:41,840 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:42,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:42,094 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:54:42,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:42,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:42,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:42,095 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:54:42,095 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:54:42,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:42,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:54:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 16:54:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:42,231 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:54:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:42,232 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:42,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:42,232 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:42,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:42,232 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:42,232 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:42,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1727501658, now seen corresponding path program 158 times [2018-12-03 16:54:42,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:42,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:42,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:42,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:42,299 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 16:54:42,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:42,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:42,300 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:42,300 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:54:42,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:42,300 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 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:42,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:42,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:42,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:42,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:42,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:42,329 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 16:54:42,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:42,430 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 16:54:42,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:42,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:42,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:42,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:42,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:42,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:42,451 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:54:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:42,703 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:42,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:42,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:42,704 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:42,704 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:42,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:42,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:42,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 16:54:42,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:42,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:42,837 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:42,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:42,837 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:42,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:42,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:42,837 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:42,837 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:42,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:42,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1727499736, now seen corresponding path program 159 times [2018-12-03 16:54:42,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:42,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:42,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:42,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:42,921 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 16:54:42,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:42,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:42,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:42,922 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:54:42,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:42,922 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 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:42,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:42,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:42,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:42,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:42,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:42,938 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 16:54:42,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:43,023 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 16:54:43,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:43,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:43,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:43,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:43,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:43,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:43,043 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:43,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:43,299 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:54:43,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:43,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:43,299 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:54:43,300 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:54:43,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:54:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 16:54:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:43,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:43,424 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:43,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:43,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:43,424 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:43,424 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:43,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:43,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1727442076, now seen corresponding path program 160 times [2018-12-03 16:54:43,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:43,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:43,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:43,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:43,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:43,485 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 16:54:43,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:43,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:43,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:43,486 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:54:43,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:43,486 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 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:43,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:43,495 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:43,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:43,502 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 16:54:43,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:43,610 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 16:54:43,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:43,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:43,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:43,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:43,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:43,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:43,631 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:43,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:43,875 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:43,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:43,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:43,876 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:43,876 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:43,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:44,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:54:44,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:44,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:44,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:44,010 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:44,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:44,010 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:44,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:44,010 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:44,010 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:44,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:44,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1727440154, now seen corresponding path program 161 times [2018-12-03 16:54:44,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:44,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:44,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:44,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:44,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:44,072 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 16:54:44,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:44,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:44,072 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:44,072 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:54:44,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:44,072 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 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:44,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:44,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:44,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:44,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:44,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:44,112 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 16:54:44,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:44,205 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 16:54:44,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:44,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:44,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:44,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:44,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:44,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:44,226 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:44,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:44,479 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:44,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:44,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:44,480 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:44,480 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:44,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2018-12-03 16:54:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:54:44,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:54:44,573 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 10 [2018-12-03 16:54:44,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:44,573 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:54:44,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:54:44,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:44,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:44,574 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:44,574 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:44,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:44,574 INFO L82 PathProgramCache]: Analyzing trace with hash -11599640, now seen corresponding path program 162 times [2018-12-03 16:54:44,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:44,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:44,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:44,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:44,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:44,631 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 16:54:44,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:44,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:44,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:44,632 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:54:44,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:44,632 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 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:44,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:44,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:44,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:44,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:44,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:44,647 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 16:54:44,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:44,736 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 16:54:44,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:44,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:44,756 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:44,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:44,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:44,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:44,756 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 10 states. [2018-12-03 16:54:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:45,015 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:45,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:45,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:45,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:45,016 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:45,016 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:45,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:45,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:54:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:45,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:45,156 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:45,156 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:45,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:45,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:45,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:45,156 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:45,156 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:45,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:45,157 INFO L82 PathProgramCache]: Analyzing trace with hash -11597718, now seen corresponding path program 163 times [2018-12-03 16:54:45,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:45,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:45,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:45,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:45,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:45,335 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 16:54:45,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:45,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:45,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:45,336 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:54:45,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:45,336 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 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:45,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:45,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:45,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:45,351 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 16:54:45,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:45,562 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 16:54:45,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:45,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:45,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:45,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:45,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:45,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:45,582 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:45,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:45,839 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:45,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:45,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:45,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:45,839 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:45,839 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:45,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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 16:54:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 16:54:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:45,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:45,971 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:45,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:45,971 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:45,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:45,971 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:45,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:45,972 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:45,972 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:45,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:45,972 INFO L82 PathProgramCache]: Analyzing trace with hash -11540058, now seen corresponding path program 164 times [2018-12-03 16:54:45,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:45,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:45,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:45,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:45,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:46,033 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 16:54:46,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:46,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:46,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:46,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 16:54:46,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:46,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 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:46,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:46,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:46,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:46,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:46,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:46,067 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 16:54:46,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:46,166 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 16:54:46,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:46,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:46,187 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:46,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:46,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:46,187 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:46,430 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:46,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:46,430 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:46,431 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:46,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 16:54:46,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:46,569 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:46,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:46,569 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:46,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:46,569 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:46,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:46,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:46,569 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:46,570 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:46,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:46,570 INFO L82 PathProgramCache]: Analyzing trace with hash -11538136, now seen corresponding path program 165 times [2018-12-03 16:54:46,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:46,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:46,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:46,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:46,571 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:46,635 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 16:54:46,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:46,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:46,635 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:46,635 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:54:46,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:46,635 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 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:46,643 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:46,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:46,650 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:46,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:46,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:46,653 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 16:54:46,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:46,751 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 16:54:46,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:46,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:46,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:46,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:46,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:46,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:46,773 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:47,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:47,044 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:47,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:47,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:47,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:47,045 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:47,045 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:47,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2018-12-03 16:54:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:47,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:54:47,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:47,172 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:47,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:47,172 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:47,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:47,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:47,172 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:47,173 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:47,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:47,173 INFO L82 PathProgramCache]: Analyzing trace with hash -9752598, now seen corresponding path program 166 times [2018-12-03 16:54:47,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:47,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:47,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:47,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:47,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:47,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:47,244 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 16:54:47,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:47,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:47,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:47,245 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:54:47,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:47,245 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 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:47,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:47,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:47,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:47,261 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 16:54:47,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:47,348 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 16:54:47,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:47,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:47,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:47,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:47,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:47,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:47,368 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:54:47,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:47,653 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:47,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:47,653 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:47,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:47,654 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:47,654 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:47,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:47,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:54:47,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:47,790 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:47,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:47,790 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:47,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:47,790 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:47,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:47,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:47,791 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:47,791 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:47,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:47,791 INFO L82 PathProgramCache]: Analyzing trace with hash -9750676, now seen corresponding path program 167 times [2018-12-03 16:54:47,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:47,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:47,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:47,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:47,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:47,859 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 16:54:47,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:47,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:47,859 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:47,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 16:54:47,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:47,860 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 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:47,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:47,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:47,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:47,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:47,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:47,877 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 16:54:47,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:47,965 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 16:54:47,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:47,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:47,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:47,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:47,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:47,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:47,985 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:48,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:48,238 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:54:48,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:48,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:48,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:48,239 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:54:48,239 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:54:48,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:54:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 16:54:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:48,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:48,386 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:48,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:48,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:48,387 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:48,387 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:48,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash -9693016, now seen corresponding path program 168 times [2018-12-03 16:54:48,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:48,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:48,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:48,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:48,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:48,448 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 16:54:48,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:48,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:48,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:48,449 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:54:48,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:48,449 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 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:48,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:48,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:48,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:48,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:48,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:48,466 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 16:54:48,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:48,571 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 16:54:48,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:48,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:48,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:48,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:48,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:48,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:48,591 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:48,841 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:54:48,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:48,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:48,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:48,842 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:54:48,842 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:54:48,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:54:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 16:54:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:48,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:48,992 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:48,992 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:48,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:48,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:48,993 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:48,993 INFO L423 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:48,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:48,993 INFO L82 PathProgramCache]: Analyzing trace with hash -9691094, now seen corresponding path program 169 times [2018-12-03 16:54:48,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:48,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:48,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:48,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:48,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:49,056 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 16:54:49,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:49,057 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:49,057 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:49,057 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:54:49,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:49,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 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:49,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:49,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:49,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:49,074 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 16:54:49,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:49,175 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 16:54:49,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:49,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:49,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:49,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:49,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:49,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:49,194 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:49,441 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:49,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:49,441 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:49,442 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:49,442 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:49,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:49,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-12-03 16:54:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:54:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:54:49,561 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 16:54:49,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:49,561 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:54:49,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:54:49,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:49,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:49,562 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:49,562 INFO L423 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:49,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash 45658662, now seen corresponding path program 170 times [2018-12-03 16:54:49,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:49,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:49,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:49,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:49,619 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 16:54:49,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:49,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:49,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:49,620 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:54:49,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:49,620 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 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:49,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:49,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:49,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:49,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:49,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:49,635 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 16:54:49,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:49,734 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 16:54:49,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:49,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:49,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:49,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:49,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:49,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:49,753 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 16:54:49,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:49,978 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:49,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:49,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:49,979 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:49,979 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:49,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:49,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:50,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 16:54:50,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:50,123 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:50,123 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:50,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:50,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:50,124 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:50,124 INFO L423 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:50,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:50,124 INFO L82 PathProgramCache]: Analyzing trace with hash 45660584, now seen corresponding path program 171 times [2018-12-03 16:54:50,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:50,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:50,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:50,188 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 16:54:50,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:50,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:50,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:50,189 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:54:50,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:50,189 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 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:50,198 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:50,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:50,207 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:50,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:50,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:50,210 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 16:54:50,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:50,403 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 16:54:50,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:50,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:50,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:50,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:50,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:50,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:50,422 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:50,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:50,636 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:54:50,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:50,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:50,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:50,637 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:54:50,637 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:54:50,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:54:50,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-12-03 16:54:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:50,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:50,784 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:50,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:50,784 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:50,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:50,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:50,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:50,784 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:50,784 INFO L423 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:50,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash 45718244, now seen corresponding path program 172 times [2018-12-03 16:54:50,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:50,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:50,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:50,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:50,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:50,857 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 16:54:50,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:50,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:50,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:50,857 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:54:50,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:50,857 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 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:50,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:50,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:50,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:50,874 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 16:54:50,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:50,977 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 16:54:50,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:50,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:50,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:50,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:50,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:51,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:51,000 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:51,227 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:54:51,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:51,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:51,228 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:54:51,228 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:54:51,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:54:51,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 16:54:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:51,371 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:51,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:51,371 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:51,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:51,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:51,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:51,372 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:51,372 INFO L423 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:51,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:51,372 INFO L82 PathProgramCache]: Analyzing trace with hash 45720166, now seen corresponding path program 173 times [2018-12-03 16:54:51,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:51,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:51,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:51,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:51,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:51,432 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 16:54:51,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:51,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:51,433 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:51,433 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:54:51,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:51,433 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 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:51,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:51,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:51,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:51,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:51,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:51,455 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 16:54:51,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:51,557 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 16:54:51,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:51,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:51,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:51,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:51,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:51,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:51,577 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:51,792 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:54:51,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:51,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:51,793 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:54:51,793 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:54:51,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:51,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:54:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2018-12-03 16:54:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:54:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:54:51,920 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:54:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:51,920 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:54:51,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:51,920 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:54:51,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:51,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:51,920 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:51,921 INFO L423 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:51,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:51,921 INFO L82 PathProgramCache]: Analyzing trace with hash 47505704, now seen corresponding path program 174 times [2018-12-03 16:54:51,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:51,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:51,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:51,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:51,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:51,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:51,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:51,981 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:54:51,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:51,981 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 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:51,989 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:51,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:52,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:52,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:52,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:52,015 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 16:54:52,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:52,118 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 16:54:52,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:52,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:52,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:52,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:52,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:52,138 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:54:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:52,344 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:54:52,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:52,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:52,344 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:54:52,344 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:54:52,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:54:52,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-12-03 16:54:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:52,492 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:52,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:52,492 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:52,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:52,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:52,492 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:52,493 INFO L423 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:52,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 47507626, now seen corresponding path program 175 times [2018-12-03 16:54:52,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:52,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:52,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:52,552 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 16:54:52,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:52,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:52,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:52,553 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:54:52,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:52,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 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:52,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:52,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:52,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:52,570 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 16:54:52,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:52,662 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 16:54:52,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:52,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:52,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:52,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:52,680 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:52,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:52,895 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:54:52,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:52,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:52,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:52,896 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:54:52,896 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:54:52,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:54:53,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-12-03 16:54:53,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:53,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:53,031 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:53,031 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:53,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:53,031 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:53,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:53,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:53,032 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:53,032 INFO L423 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:53,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:53,032 INFO L82 PathProgramCache]: Analyzing trace with hash 47565286, now seen corresponding path program 176 times [2018-12-03 16:54:53,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:53,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:53,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:53,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:53,092 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 16:54:53,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:53,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:53,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:53,092 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:54:53,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:53,092 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 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:53,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:53,101 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:53,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:53,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:53,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:53,109 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 16:54:53,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:53,210 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 16:54:53,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:53,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:53,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:53,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:53,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:53,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:53,230 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:53,442 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:54:53,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:53,443 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:53,443 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:54:53,443 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:54:53,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:54:53,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-03 16:54:53,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:53,596 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:53,596 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:53,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:53,597 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:53,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:53,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:53,597 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:54:53,597 INFO L423 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:53,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 47567208, now seen corresponding path program 177 times [2018-12-03 16:54:53,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:53,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:53,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:53,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:53,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:53,656 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 16:54:53,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:53,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:53,657 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:53,657 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:54:53,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:53,657 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 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:53,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:53,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:53,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:53,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:53,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:53,676 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 16:54:53,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:53,781 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 16:54:53,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:53,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:53,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:53,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:53,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:53,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:53,800 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:53,991 INFO L93 Difference]: Finished difference Result 20 states and 35 transitions. [2018-12-03 16:54:53,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:53,992 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:53,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:53,992 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:54:53,992 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:54:53,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:54:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-12-03 16:54:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:54:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:54:54,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 10 [2018-12-03 16:54:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:54,080 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:54:54,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:54:54,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:54,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:54,080 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:54:54,080 INFO L423 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:54,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash -297202006, now seen corresponding path program 178 times [2018-12-03 16:54:54,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:54,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:54,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:54,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:54,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:54,143 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 16:54:54,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:54,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:54,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:54,144 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:54:54,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:54,144 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 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:54,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:54,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:54,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:54,178 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 16:54:54,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:54,283 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 16:54:54,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:54,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:54,300 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:54,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:54,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:54,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:54,301 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 10 states. [2018-12-03 16:54:54,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:54,686 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:54:54,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:54,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:54,687 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:54:54,687 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:54:54,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:54,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:54:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 16:54:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:54:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:54:54,858 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:54:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:54,859 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:54:54,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:54:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:54,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:54,859 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:54,860 INFO L423 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:54,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash -297200084, now seen corresponding path program 179 times [2018-12-03 16:54:54,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:54,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:54,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:54,936 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 16:54:54,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:54,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:54,936 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:54,936 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:54:54,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:54,937 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 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:54,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:54,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:54,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:54,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:54,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:54,958 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 16:54:54,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:55,050 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 16:54:55,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:55,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:55,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:55,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:55,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:55,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:55,071 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:54:55,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:55,467 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:54:55,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:55,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:55,468 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:54:55,468 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:54:55,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:55,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:54:55,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 16:54:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:55,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:55,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:55,632 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:55,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:55,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:55,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:55,632 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:55,633 INFO L423 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:55,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:55,633 INFO L82 PathProgramCache]: Analyzing trace with hash -297142424, now seen corresponding path program 180 times [2018-12-03 16:54:55,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:55,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:55,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:55,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:55,738 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 16:54:55,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:55,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:55,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:55,738 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:54:55,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:55,739 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 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:55,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:55,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:55,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:55,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:55,754 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 16:54:55,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:55,851 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 16:54:55,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:55,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:55,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:55,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:55,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:55,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:55,872 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:56,273 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:54:56,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:56,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:56,274 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:54:56,274 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:54:56,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:54:56,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 16:54:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:54:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:54:56,446 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:54:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:56,446 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:54:56,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:56,446 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:54:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:56,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:56,446 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:56,447 INFO L423 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:56,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:56,447 INFO L82 PathProgramCache]: Analyzing trace with hash -297140502, now seen corresponding path program 181 times [2018-12-03 16:54:56,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:56,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:56,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:56,515 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 16:54:56,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:56,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:56,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:56,516 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:54:56,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:56,516 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 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:56,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:56,524 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:56,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:56,532 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 16:54:56,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:56,621 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 16:54:56,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:56,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:56,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:56,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:56,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:56,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:56,640 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:54:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:57,005 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:54:57,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:57,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:57,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:57,006 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:54:57,006 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:54:57,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:57,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:54:57,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 16. [2018-12-03 16:54:57,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:54:57,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:54:57,168 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:54:57,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:57,168 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:54:57,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:57,169 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:54:57,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:57,169 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:57,169 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:54:57,169 INFO L423 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:57,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:57,169 INFO L82 PathProgramCache]: Analyzing trace with hash -295354964, now seen corresponding path program 182 times [2018-12-03 16:54:57,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:57,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:57,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:57,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:57,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:57,246 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 16:54:57,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:57,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:57,247 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:57,247 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:54:57,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:57,247 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 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:57,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:57,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:57,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:54:57,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:57,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:57,263 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 16:54:57,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:57,625 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 16:54:57,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:57,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:57,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:57,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:57,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:57,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:57,645 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:54:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:58,024 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:54:58,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:58,024 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:58,024 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:54:58,025 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:54:58,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:54:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 16:54:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:54:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:54:58,212 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:54:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:58,212 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:54:58,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:54:58,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:58,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:58,213 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:58,213 INFO L423 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:58,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:58,213 INFO L82 PathProgramCache]: Analyzing trace with hash -295353042, now seen corresponding path program 183 times [2018-12-03 16:54:58,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:58,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:58,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:58,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:58,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:58,273 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 16:54:58,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:58,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:58,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:58,274 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:54:58,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:58,274 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 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:58,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:58,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:58,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:58,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:58,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:58,291 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 16:54:58,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:58,377 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 16:54:58,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:58,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:58,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:58,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:58,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:58,396 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:54:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:58,793 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:54:58,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:58,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:58,794 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:54:58,794 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:54:58,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:54:59,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 16:54:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:54:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:54:59,085 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:54:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:59,085 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:54:59,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:54:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:59,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:59,086 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:59,086 INFO L423 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:59,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:59,086 INFO L82 PathProgramCache]: Analyzing trace with hash -295295382, now seen corresponding path program 184 times [2018-12-03 16:54:59,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:59,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:59,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:59,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:59,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:59,223 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 16:54:59,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:59,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:59,224 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:59,224 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:54:59,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:59,224 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 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:59,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:59,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:59,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:59,238 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 16:54:59,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:59,339 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 16:54:59,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:59,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:54:59,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:59,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:54:59,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:54:59,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:59,358 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:54:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:59,742 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:54:59,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:54:59,750 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:54:59,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:59,750 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:54:59,750 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:54:59,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:54:59,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:54:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 16:54:59,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:54:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:54:59,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:54:59,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:59,925 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:54:59,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:54:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:54:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:54:59,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:59,926 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:54:59,926 INFO L423 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:59,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:59,926 INFO L82 PathProgramCache]: Analyzing trace with hash -295293460, now seen corresponding path program 185 times [2018-12-03 16:54:59,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:59,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:59,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:59,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:59,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:59,988 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 16:54:59,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:59,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:59,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:59,988 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:54:59,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:59,988 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 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:59,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:59,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:00,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:00,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:00,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:00,061 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 16:55:00,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:00,195 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 16:55:00,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:00,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:00,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:00,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:00,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:00,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:00,214 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:00,578 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:55:00,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:00,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:00,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:00,578 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:55:00,579 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:55:00,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:00,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:55:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 15. [2018-12-03 16:55:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:55:00,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:55:00,725 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:55:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:00,725 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:55:00,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:55:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:00,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:00,726 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:00,726 INFO L423 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:00,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash -239943704, now seen corresponding path program 186 times [2018-12-03 16:55:00,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:00,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:00,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:00,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:00,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:00,822 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 16:55:00,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:00,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:00,822 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:00,822 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:55:00,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:00,822 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 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:00,831 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:00,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:00,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:00,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:00,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:00,839 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 16:55:00,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:00,964 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 16:55:00,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:00,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:00,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:00,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:00,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:00,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:00,984 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:55:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:01,345 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:55:01,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:01,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:01,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:01,346 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:55:01,346 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:55:01,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:01,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:55:01,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:55:01,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:01,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:01,522 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:01,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:01,522 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:01,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:01,522 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:01,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:01,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:01,522 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:01,522 INFO L423 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:01,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:01,523 INFO L82 PathProgramCache]: Analyzing trace with hash -239941782, now seen corresponding path program 187 times [2018-12-03 16:55:01,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:01,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:01,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:01,583 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 16:55:01,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:01,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:01,583 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:01,583 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:55:01,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:01,583 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 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:01,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:01,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:01,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:01,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:01,599 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 16:55:01,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:01,689 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 16:55:01,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:01,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:01,708 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:01,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:01,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:01,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:01,708 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:02,055 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:55:02,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:02,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:02,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:02,056 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:55:02,056 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:55:02,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:02,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:55:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 16:55:02,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:02,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:02,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:02,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:02,231 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:02,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:02,231 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:02,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:02,231 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:02,231 INFO L423 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:02,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:02,232 INFO L82 PathProgramCache]: Analyzing trace with hash -239884122, now seen corresponding path program 188 times [2018-12-03 16:55:02,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:02,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:02,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:02,292 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 16:55:02,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:02,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:02,292 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:02,292 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:55:02,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:02,292 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 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:02,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:02,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:02,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:02,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:02,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:02,311 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 16:55:02,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:02,418 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 16:55:02,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:02,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:02,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:02,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:02,439 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:02,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:02,809 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:55:02,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:02,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:02,810 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:55:02,810 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:55:02,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:55:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:55:02,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:02,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:02,992 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:02,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:02,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:02,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:02,992 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:02,992 INFO L423 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:02,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:02,993 INFO L82 PathProgramCache]: Analyzing trace with hash -239882200, now seen corresponding path program 189 times [2018-12-03 16:55:02,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:02,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:02,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:02,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:02,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:03,053 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 16:55:03,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:03,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:03,053 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:03,053 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:55:03,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:03,054 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 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:03,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:03,063 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:03,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:03,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:03,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:03,091 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 16:55:03,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:03,255 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 16:55:03,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:03,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:03,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:03,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:03,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:03,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:03,274 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:03,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:03,614 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:55:03,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:03,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:03,615 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:55:03,615 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:55:03,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:55:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-03 16:55:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:55:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:55:03,780 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:55:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:03,780 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:55:03,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:03,780 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:55:03,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:03,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:03,781 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:03,781 INFO L423 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:03,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:03,781 INFO L82 PathProgramCache]: Analyzing trace with hash -238096662, now seen corresponding path program 190 times [2018-12-03 16:55:03,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:03,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:03,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:03,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:03,850 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 16:55:03,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:03,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:03,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:03,850 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:55:03,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:03,851 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 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:03,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:03,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:03,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:03,865 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 16:55:03,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:03,969 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 16:55:03,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:03,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:03,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:03,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:03,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:03,988 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:55:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:04,329 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:55:04,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:04,330 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:04,330 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:55:04,330 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:55:04,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:55:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 16:55:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:04,525 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:04,525 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:04,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:04,525 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:04,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:04,525 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:04,526 INFO L423 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:04,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:04,526 INFO L82 PathProgramCache]: Analyzing trace with hash -238094740, now seen corresponding path program 191 times [2018-12-03 16:55:04,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:04,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:04,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:04,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:04,588 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 16:55:04,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:04,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:04,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:04,588 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:55:04,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:04,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 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:04,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:04,601 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:04,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:04,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:04,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:04,610 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 16:55:04,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:04,713 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 16:55:04,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:04,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:04,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:04,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:04,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:04,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:04,733 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:05,083 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:55:05,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:05,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:05,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:05,084 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:55:05,084 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:55:05,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:55:05,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:55:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:05,287 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:05,287 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:05,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:05,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:05,288 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:05,288 INFO L423 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:05,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:05,288 INFO L82 PathProgramCache]: Analyzing trace with hash -238037080, now seen corresponding path program 192 times [2018-12-03 16:55:05,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:05,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:05,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:05,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:05,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:05,348 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 16:55:05,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:05,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:05,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:05,349 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:55:05,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:05,349 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 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:05,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:05,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:05,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:05,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:05,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:05,366 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 16:55:05,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:05,448 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 16:55:05,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:05,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:05,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:05,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:05,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:05,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:05,468 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:05,789 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:55:05,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:05,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:05,790 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:55:05,790 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:55:05,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:55:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 16:55:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:05,967 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:05,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:05,967 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:05,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:05,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:05,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:05,968 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:05,968 INFO L423 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:05,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:05,968 INFO L82 PathProgramCache]: Analyzing trace with hash -238035158, now seen corresponding path program 193 times [2018-12-03 16:55:05,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:05,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:05,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:05,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:05,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:06,044 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 16:55:06,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:06,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:06,044 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:06,044 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:55:06,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:06,045 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 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:06,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:06,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:06,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:06,059 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 16:55:06,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:06,133 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 16:55:06,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:06,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:06,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:06,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:06,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:06,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:06,153 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:06,471 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:55:06,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:06,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:06,472 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:55:06,472 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:55:06,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:06,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:55:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 14. [2018-12-03 16:55:06,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:55:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:55:06,605 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 16:55:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:06,605 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:55:06,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:55:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:06,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:06,605 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:06,605 INFO L423 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:06,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1477805356, now seen corresponding path program 194 times [2018-12-03 16:55:06,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:06,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:06,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:06,666 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 16:55:06,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:06,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:06,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:06,666 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:55:06,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:06,667 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 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:06,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:06,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:06,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:06,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:06,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:06,685 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 16:55:06,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:06,784 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 16:55:06,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:06,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:06,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:06,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:06,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:06,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:06,805 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 16:55:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:07,228 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:55:07,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:07,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:07,228 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:55:07,229 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:55:07,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:55:07,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 16:55:07,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:07,410 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:07,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:07,410 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:07,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:07,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:07,411 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:07,411 INFO L423 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:07,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:07,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1477807278, now seen corresponding path program 195 times [2018-12-03 16:55:07,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:07,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:07,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:07,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:07,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:07,476 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 16:55:07,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:07,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:07,477 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:07,477 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:55:07,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:07,477 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 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:07,486 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:07,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:07,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:07,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:07,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:07,502 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 16:55:07,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:07,603 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 16:55:07,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:07,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:07,623 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:07,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:07,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:07,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:07,624 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:08,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:08,059 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:55:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:08,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:08,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:08,060 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:55:08,060 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:55:08,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:55:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 16:55:08,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:08,252 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:08,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:08,252 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:08,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:08,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:08,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:08,252 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:08,253 INFO L423 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:08,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:08,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1477864938, now seen corresponding path program 196 times [2018-12-03 16:55:08,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:08,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:08,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:08,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:08,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:08,314 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 16:55:08,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:08,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:08,314 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:08,314 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:55:08,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:08,315 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 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:08,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:08,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:08,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:08,332 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 16:55:08,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:08,429 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 16:55:08,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:08,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:08,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:08,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:08,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:08,450 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:08,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:08,861 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:55:08,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:08,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:08,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:08,862 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:55:08,862 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:55:08,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:55:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 16:55:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:09,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:09,067 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:09,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:09,067 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:09,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:09,067 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:09,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:09,067 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:09,067 INFO L423 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:09,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:09,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1477866860, now seen corresponding path program 197 times [2018-12-03 16:55:09,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:09,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:09,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:09,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:09,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:09,126 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 16:55:09,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:09,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:09,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:09,127 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:55:09,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:09,127 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 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:09,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:09,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:09,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:09,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:09,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:09,144 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 16:55:09,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:09,256 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 16:55:09,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:09,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:09,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:09,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:09,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:09,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:09,276 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:09,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:09,679 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:55:09,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:09,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:09,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:09,680 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:55:09,680 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:55:09,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:55:09,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 16. [2018-12-03 16:55:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:55:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:55:09,849 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:55:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:09,849 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:55:09,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:55:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:09,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:09,850 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:09,850 INFO L423 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:09,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:09,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1479652398, now seen corresponding path program 198 times [2018-12-03 16:55:09,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:09,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:09,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:09,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:09,851 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:09,910 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 16:55:09,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:09,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:09,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:09,911 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:55:09,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:09,911 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 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:09,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:09,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:09,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:09,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:09,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:09,928 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 16:55:09,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:10,028 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 16:55:10,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:10,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:10,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:10,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:10,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:10,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:10,046 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:55:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:10,467 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:55:10,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:10,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:10,468 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:55:10,468 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:55:10,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:10,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:55:10,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 16:55:10,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:10,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:10,653 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:10,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:10,654 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:10,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:10,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:10,654 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:10,654 INFO L423 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:10,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:10,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1479654320, now seen corresponding path program 199 times [2018-12-03 16:55:10,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:10,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:10,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:10,787 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 16:55:10,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:10,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:10,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:10,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 16:55:10,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:10,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 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:10,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:10,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:10,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:10,804 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 16:55:10,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:11,042 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 16:55:11,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:11,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:11,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:11,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:11,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:11,061 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:11,490 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:55:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:11,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:11,490 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:55:11,490 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:55:11,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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 16:55:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:55:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 16:55:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:11,688 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:11,688 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:11,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:11,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:11,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:11,689 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:11,689 INFO L423 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:11,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1479711980, now seen corresponding path program 200 times [2018-12-03 16:55:11,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:11,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:11,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:11,748 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 16:55:11,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:11,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:11,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:11,748 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:55:11,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:11,748 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 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:11,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:11,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:11,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:11,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:11,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:11,764 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 16:55:11,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:11,855 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 16:55:11,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:11,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:11,873 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:11,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:11,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:11,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:11,873 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:12,275 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:55:12,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:12,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:12,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:12,276 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:55:12,276 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:55:12,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:12,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:55:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 16:55:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:12,486 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:12,486 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:12,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:12,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:12,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:12,487 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:12,487 INFO L423 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:12,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:12,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1479713902, now seen corresponding path program 201 times [2018-12-03 16:55:12,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:12,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:12,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:12,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:12,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:12,555 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 16:55:12,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:12,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:12,556 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:12,556 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:55:12,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:12,556 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 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:12,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:12,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:12,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:12,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:12,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:12,573 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 16:55:12,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:12,672 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 16:55:12,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:12,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:12,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:12,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:12,691 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:13,073 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:55:13,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:13,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:13,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:13,074 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:55:13,074 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:55:13,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:13,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:55:13,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 15. [2018-12-03 16:55:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:55:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:55:13,246 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:55:13,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:13,246 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:55:13,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:13,246 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:55:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:13,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:13,246 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:13,247 INFO L423 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:13,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:13,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1535063658, now seen corresponding path program 202 times [2018-12-03 16:55:13,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:13,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:13,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:13,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:13,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:13,308 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 16:55:13,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:13,309 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:13,309 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:13,309 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:55:13,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:13,309 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 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:13,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:13,318 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:13,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:13,325 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 16:55:13,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:13,427 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 16:55:13,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:13,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:13,445 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:13,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:13,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:13,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:13,446 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:55:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:13,837 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:55:13,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:13,838 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:13,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:13,838 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:55:13,838 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:55:13,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:13,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:55:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:55:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:14,030 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:14,031 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:14,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:14,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:14,031 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:14,031 INFO L423 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:14,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:14,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1535065580, now seen corresponding path program 203 times [2018-12-03 16:55:14,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:14,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:14,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:14,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:14,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:14,092 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 16:55:14,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:14,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:14,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:14,092 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:55:14,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:14,093 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 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:14,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:14,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:14,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:14,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:14,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:14,111 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 16:55:14,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:14,200 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 16:55:14,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:14,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:14,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:14,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:14,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:14,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:14,220 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:14,599 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:55:14,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:14,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:14,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:14,599 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:55:14,600 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:55:14,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:14,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:55:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 16:55:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:14,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:14,780 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:14,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:14,780 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:14,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:14,780 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:14,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:14,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:14,780 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:14,780 INFO L423 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:14,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:14,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1535123240, now seen corresponding path program 204 times [2018-12-03 16:55:14,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:14,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:14,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:14,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:14,839 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 16:55:14,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:14,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:14,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:14,840 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:55:14,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:14,840 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 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:14,848 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:14,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:14,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:14,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:14,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:14,855 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 16:55:14,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:14,946 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 16:55:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:14,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:14,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:14,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:14,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:14,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:14,965 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:15,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:15,360 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:55:15,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:15,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:15,361 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:55:15,361 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:55:15,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:15,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:55:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:55:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:15,565 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:15,565 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:15,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:15,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:15,565 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:15,565 INFO L423 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:15,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:15,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1535125162, now seen corresponding path program 205 times [2018-12-03 16:55:15,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:15,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:15,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:15,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:15,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:15,629 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 16:55:15,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:15,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:15,630 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:15,630 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:55:15,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:15,630 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 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:15,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:15,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:15,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:15,644 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 16:55:15,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:15,732 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 16:55:15,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:15,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:15,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:15,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:15,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:15,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:15,751 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:16,124 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:55:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:16,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:16,125 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:55:16,125 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:55:16,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:55:16,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-03 16:55:16,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:55:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:55:16,299 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:55:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:16,299 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:55:16,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:16,299 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:55:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:16,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:16,300 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:16,300 INFO L423 AbstractCegarLoop]: === Iteration 220 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:16,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:16,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1536910700, now seen corresponding path program 206 times [2018-12-03 16:55:16,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:16,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:16,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:16,361 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 16:55:16,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:16,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:16,361 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:16,361 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:55:16,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:16,361 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 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:16,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:16,370 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:16,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:16,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:16,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:16,378 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 16:55:16,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:16,485 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 16:55:16,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:16,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:16,504 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:16,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:16,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:16,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:16,505 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:55:16,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:16,860 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:55:16,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:16,860 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:16,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:16,861 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:55:16,861 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:55:16,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:16,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:55:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 16:55:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:17,054 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:17,054 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:17,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:17,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:17,054 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:17,055 INFO L423 AbstractCegarLoop]: === Iteration 221 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:17,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:17,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1536912622, now seen corresponding path program 207 times [2018-12-03 16:55:17,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:17,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:17,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:17,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:17,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:17,115 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 16:55:17,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:17,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:17,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:17,116 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:55:17,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:17,116 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 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:17,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:17,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:17,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:17,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:17,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:17,133 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 16:55:17,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:17,233 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 16:55:17,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:17,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:17,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:17,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:17,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:17,251 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:17,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:17,622 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:55:17,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:17,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:17,622 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:55:17,622 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:55:17,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:55:17,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:55:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:17,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:17,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:17,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:17,814 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:17,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:17,814 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:17,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:17,814 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:17,815 INFO L423 AbstractCegarLoop]: === Iteration 222 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:17,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:17,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1536970282, now seen corresponding path program 208 times [2018-12-03 16:55:17,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:17,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:17,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:17,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:17,875 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 16:55:17,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:17,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:17,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:17,875 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:55:17,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:17,876 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 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:17,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:17,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:17,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:17,890 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 16:55:17,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:17,982 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 16:55:18,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:18,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:18,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:18,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:18,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:18,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:18,002 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:18,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:18,370 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:55:18,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:18,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:18,371 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:55:18,371 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:55:18,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:55:18,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 16:55:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:18,563 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:18,564 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:18,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:18,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:18,564 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:55:18,564 INFO L423 AbstractCegarLoop]: === Iteration 223 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:18,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:18,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1536972204, now seen corresponding path program 209 times [2018-12-03 16:55:18,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:18,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:18,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:18,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:18,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:18,624 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 16:55:18,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:18,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:18,624 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:18,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:18,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:18,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:18,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:18,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:18,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:18,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:18,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:18,644 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 16:55:18,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:18,745 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 16:55:18,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:18,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:18,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:18,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:18,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:18,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:18,765 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:19,093 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:55:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:19,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:19,094 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:55:19,094 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:55:19,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:55:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 13. [2018-12-03 16:55:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:55:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:55:19,218 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 10 [2018-12-03 16:55:19,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:19,218 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:55:19,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:19,218 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:55:19,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:19,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:19,218 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:19,219 INFO L423 AbstractCegarLoop]: === Iteration 224 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:19,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:19,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1106548632, now seen corresponding path program 210 times [2018-12-03 16:55:19,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:19,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:19,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:19,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:19,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:19,280 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 16:55:19,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:19,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:19,281 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:19,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 16:55:19,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:19,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 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:19,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:19,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:19,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:19,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:19,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:19,296 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 16:55:19,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:19,411 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 16:55:19,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:19,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:19,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:19,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:19,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:19,429 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 10 states. [2018-12-03 16:55:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:19,851 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:55:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:19,851 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:19,852 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:55:19,852 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:55:19,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:55:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:55:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:20,063 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:20,063 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:20,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:20,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:20,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:20,064 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:20,064 INFO L423 AbstractCegarLoop]: === Iteration 225 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:20,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:20,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1106546710, now seen corresponding path program 211 times [2018-12-03 16:55:20,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:20,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:20,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:20,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:20,184 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 16:55:20,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:20,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:20,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:20,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 16:55:20,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:20,184 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 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:20,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:20,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:20,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:20,202 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 16:55:20,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:20,292 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 16:55:20,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:20,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:20,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:20,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:20,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:20,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:20,311 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:20,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:20,713 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:55:20,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:20,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:20,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:20,714 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:55:20,714 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:55:20,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:55:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:55:20,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:20,920 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:20,920 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:20,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:20,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:20,920 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:20,920 INFO L423 AbstractCegarLoop]: === Iteration 226 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:20,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:20,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1106489050, now seen corresponding path program 212 times [2018-12-03 16:55:20,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:20,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:20,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:20,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:20,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:21,005 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 16:55:21,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:21,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:21,006 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:21,006 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:55:21,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:21,006 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 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:21,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:21,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:21,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:21,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:21,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:21,027 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 16:55:21,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:21,228 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 16:55:21,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:21,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:21,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:21,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:21,247 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:21,665 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:55:21,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:21,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:21,666 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:55:21,666 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:55:21,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:21,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:55:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:55:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:21,877 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:21,877 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:21,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:21,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:21,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:21,877 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:21,877 INFO L423 AbstractCegarLoop]: === Iteration 227 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:21,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1106487128, now seen corresponding path program 213 times [2018-12-03 16:55:21,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:21,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:21,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:21,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:21,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:21,937 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 16:55:21,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:21,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:21,938 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:21,938 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:55:21,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:21,938 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 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:21,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:21,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:21,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:21,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:21,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:21,953 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 16:55:21,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:22,155 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 16:55:22,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:22,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:22,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:22,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:22,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:22,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:22,175 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:22,571 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:55:22,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:22,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:22,572 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:55:22,572 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:55:22,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:22,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:55:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-12-03 16:55:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:55:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:55:22,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:55:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:22,773 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:55:22,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:22,773 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:55:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:22,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:22,773 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:22,773 INFO L423 AbstractCegarLoop]: === Iteration 228 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:22,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:22,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1104701590, now seen corresponding path program 214 times [2018-12-03 16:55:22,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:22,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:22,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:22,842 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 16:55:22,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:22,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:22,843 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:22,843 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:55:22,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:22,843 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 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:22,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:22,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:22,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:22,860 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 16:55:22,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:22,964 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 16:55:22,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:22,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:22,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:22,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:22,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:22,985 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:55:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:23,353 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:55:23,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:23,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:23,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:23,353 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:55:23,354 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:55:23,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:23,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:55:23,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 16:55:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:23,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:23,565 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:23,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:23,565 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:23,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:23,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:23,566 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:23,566 INFO L423 AbstractCegarLoop]: === Iteration 229 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:23,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1104699668, now seen corresponding path program 215 times [2018-12-03 16:55:23,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:23,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:23,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:23,628 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 16:55:23,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:23,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:23,629 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:23,629 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:55:23,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:23,629 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 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:23,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:23,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:23,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:23,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:23,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:23,645 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 16:55:23,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:23,744 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 16:55:23,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:23,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:23,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:23,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:23,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:23,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:23,764 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:24,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:24,164 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:55:24,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:24,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:24,165 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:55:24,165 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:55:24,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:24,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:55:24,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2018-12-03 16:55:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:24,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:24,369 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:24,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:24,369 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:24,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:24,370 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:24,370 INFO L423 AbstractCegarLoop]: === Iteration 230 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:24,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:24,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1104642008, now seen corresponding path program 216 times [2018-12-03 16:55:24,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:24,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:24,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:24,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:24,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:24,435 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 16:55:24,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:24,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:24,436 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:24,436 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:55:24,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:24,436 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 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:24,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:24,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:24,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:24,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:24,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:24,455 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 16:55:24,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:24,544 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 16:55:24,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:24,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:24,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:24,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:24,564 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:24,928 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:55:24,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:24,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:24,929 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:55:24,929 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:55:24,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:24,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:55:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 16:55:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:25,158 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:25,158 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:25,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:25,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:25,159 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:25,159 INFO L423 AbstractCegarLoop]: === Iteration 231 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:25,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:25,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1104640086, now seen corresponding path program 217 times [2018-12-03 16:55:25,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:25,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:25,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:25,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:25,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:25,221 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 16:55:25,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:25,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:25,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:25,222 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:55:25,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:25,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 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:25,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:25,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:25,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:25,239 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 16:55:25,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:25,335 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 16:55:25,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:25,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:25,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:25,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:25,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:25,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:25,355 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:25,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:25,743 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:55:25,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:25,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:25,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:25,743 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:55:25,743 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:55:25,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:55:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2018-12-03 16:55:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:55:25,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:55:25,914 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:55:25,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:25,914 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:55:25,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:55:25,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:25,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:25,915 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:25,915 INFO L423 AbstractCegarLoop]: === Iteration 232 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:25,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:25,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1049290330, now seen corresponding path program 218 times [2018-12-03 16:55:25,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:25,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:25,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:25,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:25,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:25,973 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 16:55:25,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:25,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:25,973 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:25,973 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:55:25,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:25,973 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 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:25,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:25,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:25,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:25,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:25,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:25,992 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 16:55:25,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:26,275 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 16:55:26,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:26,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:26,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:26,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:26,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:26,294 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:55:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:26,787 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:55:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:26,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:26,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:26,787 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:55:26,788 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:55:26,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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 16:55:26,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:55:27,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:55:27,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:27,026 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:27,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:27,027 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:27,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:27,027 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:27,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:27,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:27,027 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:27,027 INFO L423 AbstractCegarLoop]: === Iteration 233 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:27,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:27,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1049288408, now seen corresponding path program 219 times [2018-12-03 16:55:27,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:27,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:27,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:27,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:27,086 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 16:55:27,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:27,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:27,086 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:27,086 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:55:27,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:27,087 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 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:27,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:27,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:27,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:27,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:27,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:27,103 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 16:55:27,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:27,195 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 16:55:27,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:27,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:27,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:27,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:27,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:27,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:27,217 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:27,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:27,674 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:55:27,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:27,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:27,675 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:55:27,675 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:55:27,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:55:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2018-12-03 16:55:27,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:27,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:27,884 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:27,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:27,885 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:27,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:27,885 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:27,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:27,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:27,885 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:27,885 INFO L423 AbstractCegarLoop]: === Iteration 234 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:27,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1049230748, now seen corresponding path program 220 times [2018-12-03 16:55:27,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:27,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:27,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:27,949 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 16:55:27,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:27,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:27,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:27,949 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:55:27,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:27,950 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 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:27,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:27,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:27,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:27,967 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 16:55:27,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:28,055 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 16:55:28,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:28,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:28,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:28,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:28,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:28,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:28,074 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:28,506 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:55:28,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:28,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:28,507 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:55:28,507 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:55:28,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:55:28,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:55:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:28,724 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:28,724 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:28,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:28,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:28,725 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:28,725 INFO L423 AbstractCegarLoop]: === Iteration 235 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:28,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1049228826, now seen corresponding path program 221 times [2018-12-03 16:55:28,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:28,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:28,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:28,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:28,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:28,789 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 16:55:28,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:28,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:28,789 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:28,789 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:55:28,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:28,789 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 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:28,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:28,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:28,802 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:28,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:28,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:28,805 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 16:55:28,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:28,910 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 16:55:28,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:28,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:28,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:28,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:28,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:28,931 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:29,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:29,352 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:55:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:29,352 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:29,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:29,353 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:55:29,353 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:55:29,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:55:29,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-12-03 16:55:29,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:55:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:55:29,566 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:55:29,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:29,566 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:55:29,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:55:29,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:29,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:29,566 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:29,566 INFO L423 AbstractCegarLoop]: === Iteration 236 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:29,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1047443288, now seen corresponding path program 222 times [2018-12-03 16:55:29,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:29,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:29,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:29,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:29,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:29,628 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 16:55:29,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:29,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:29,629 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:29,629 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:55:29,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:29,629 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 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:29,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:29,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:29,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:29,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:29,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:29,646 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 16:55:29,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:29,748 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 16:55:29,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:29,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:29,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:29,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:29,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:29,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:29,768 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:55:30,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:30,179 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:55:30,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:30,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:30,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:30,180 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:55:30,180 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:55:30,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:55:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 16:55:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:30,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:30,396 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:30,396 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:30,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:30,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:30,396 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:30,397 INFO L423 AbstractCegarLoop]: === Iteration 237 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:30,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:30,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1047441366, now seen corresponding path program 223 times [2018-12-03 16:55:30,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:30,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:30,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:30,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:30,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:30,455 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 16:55:30,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:30,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:30,455 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:30,455 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:55:30,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:30,456 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 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:30,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:30,463 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:30,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:30,470 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 16:55:30,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:30,558 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 16:55:30,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:30,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:30,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:30,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:30,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:30,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:30,578 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:30,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:30,972 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:55:30,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:30,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:30,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:30,973 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:55:30,973 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:55:30,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:30,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:55:31,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2018-12-03 16:55:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:31,182 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:31,182 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:31,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:31,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:31,182 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:31,182 INFO L423 AbstractCegarLoop]: === Iteration 238 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:31,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1047383706, now seen corresponding path program 224 times [2018-12-03 16:55:31,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:31,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:31,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:31,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:31,276 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 16:55:31,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:31,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:31,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:31,276 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:55:31,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:31,276 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 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:31,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:31,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:31,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:31,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:31,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:31,292 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 16:55:31,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:31,504 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 16:55:31,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:31,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:31,522 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:31,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:31,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:31,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:31,523 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:31,911 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:55:31,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:31,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:31,912 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:55:31,912 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:55:31,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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 16:55:31,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:55:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 16:55:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:32,126 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:32,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:32,126 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:32,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:32,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:32,126 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:55:32,127 INFO L423 AbstractCegarLoop]: === Iteration 239 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:32,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:32,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1047381784, now seen corresponding path program 225 times [2018-12-03 16:55:32,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:32,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:32,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:32,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:32,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:32,188 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 16:55:32,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:32,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:32,188 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:32,188 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:55:32,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:32,188 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 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:32,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:32,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:32,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:32,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:32,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:32,204 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 16:55:32,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:32,301 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 16:55:32,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:32,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:32,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:32,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:32,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:32,321 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:32,667 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:55:32,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:32,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:32,668 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:55:32,668 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:55:32,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:55:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2018-12-03 16:55:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:55:32,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:55:32,837 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 10 [2018-12-03 16:55:32,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:32,837 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:55:32,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:32,837 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:55:32,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:32,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:32,837 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:32,838 INFO L423 AbstractCegarLoop]: === Iteration 240 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:32,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:32,838 INFO L82 PathProgramCache]: Analyzing trace with hash 668458730, now seen corresponding path program 226 times [2018-12-03 16:55:32,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:32,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:32,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:32,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:32,900 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 16:55:32,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:32,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:32,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:32,900 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:55:32,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:32,900 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 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:32,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:32,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:32,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:32,915 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 16:55:32,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:33,015 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 16:55:33,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:33,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:33,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:33,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:33,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:33,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:33,035 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 10 states. [2018-12-03 16:55:33,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:33,402 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:55:33,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:33,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:33,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:33,403 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:55:33,403 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:55:33,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:55:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 16:55:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:33,650 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:33,650 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:33,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:33,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:33,651 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:33,651 INFO L423 AbstractCegarLoop]: === Iteration 241 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:33,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash 668460652, now seen corresponding path program 227 times [2018-12-03 16:55:33,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:33,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:33,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:33,711 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 16:55:33,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:33,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:33,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:33,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 16:55:33,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:33,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 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:33,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:33,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:33,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:33,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:33,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:33,729 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 16:55:33,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:33,820 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 16:55:33,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:33,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:33,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:33,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:33,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:33,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:33,840 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:34,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:34,211 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:55:34,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:34,211 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:34,211 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:55:34,211 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:55:34,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:55:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 16:55:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:34,427 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:34,428 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:34,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:34,428 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:34,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:34,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:34,428 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:34,428 INFO L423 AbstractCegarLoop]: === Iteration 242 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:34,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 668518312, now seen corresponding path program 228 times [2018-12-03 16:55:34,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:34,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:34,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:34,492 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 16:55:34,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:34,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:34,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:34,492 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:55:34,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:34,492 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 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:34,502 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:34,502 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:34,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:34,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:34,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:34,509 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 16:55:34,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:34,600 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 16:55:34,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:34,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:34,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:34,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:34,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:34,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:34,620 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:34,988 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:55:34,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:34,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:34,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:34,989 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:55:34,989 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:55:34,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:34,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:55:35,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-12-03 16:55:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:35,215 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:35,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:35,215 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:35,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:35,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:35,215 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:35,216 INFO L423 AbstractCegarLoop]: === Iteration 243 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:35,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:35,216 INFO L82 PathProgramCache]: Analyzing trace with hash 668520234, now seen corresponding path program 229 times [2018-12-03 16:55:35,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:35,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:35,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:35,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:35,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:35,274 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 16:55:35,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:35,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:35,275 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:35,275 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:55:35,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:35,275 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 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:35,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:35,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:35,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:35,290 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 16:55:35,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:35,377 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 16:55:35,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:35,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:35,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:35,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:35,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:35,398 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:35,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:35,754 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:55:35,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:35,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:35,755 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:55:35,755 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:55:35,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:55:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-12-03 16:55:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:55:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:55:35,957 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:55:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:35,957 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:55:35,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:35,957 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:55:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:35,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:35,958 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:35,958 INFO L423 AbstractCegarLoop]: === Iteration 244 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:35,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:35,958 INFO L82 PathProgramCache]: Analyzing trace with hash 670305772, now seen corresponding path program 230 times [2018-12-03 16:55:35,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:35,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:35,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:35,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:36,020 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 16:55:36,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:36,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:36,020 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:36,020 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:55:36,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:36,020 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 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:36,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:36,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:36,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:36,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:36,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:36,040 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 16:55:36,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:36,137 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 16:55:36,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:36,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:36,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:36,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:36,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:36,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:36,156 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:55:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:36,542 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:55:36,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:36,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:36,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:36,542 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:55:36,542 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:55:36,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:36,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:55:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 16:55:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:36,773 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:36,773 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:36,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:36,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:36,774 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:36,774 INFO L423 AbstractCegarLoop]: === Iteration 245 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:36,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 670307694, now seen corresponding path program 231 times [2018-12-03 16:55:36,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:36,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:36,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:36,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:36,854 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 16:55:36,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:36,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:36,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:36,854 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:55:36,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:36,854 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 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:36,865 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:36,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:36,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:36,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:36,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:36,873 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 16:55:36,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:36,958 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 16:55:36,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:36,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:36,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:36,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:36,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:36,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:36,977 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:37,369 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:55:37,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:37,369 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:37,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:37,370 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:55:37,370 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:55:37,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:37,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:55:37,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 16:55:37,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:37,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:37,605 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:37,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:37,605 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:37,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:37,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:37,605 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:37,606 INFO L423 AbstractCegarLoop]: === Iteration 246 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:37,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:37,606 INFO L82 PathProgramCache]: Analyzing trace with hash 670365354, now seen corresponding path program 232 times [2018-12-03 16:55:37,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:37,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:37,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:37,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:37,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:37,666 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 16:55:37,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:37,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:37,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:37,667 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:55:37,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:37,667 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 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:37,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:37,677 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:37,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:37,684 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 16:55:37,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:37,769 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 16:55:37,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:37,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:37,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:37,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:37,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:37,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:37,788 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:38,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:38,153 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:55:38,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:38,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:38,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:38,154 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:55:38,154 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:55:38,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:38,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:55:38,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-12-03 16:55:38,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:38,390 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:38,391 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:38,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:38,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:38,391 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:55:38,391 INFO L423 AbstractCegarLoop]: === Iteration 247 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:38,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:38,391 INFO L82 PathProgramCache]: Analyzing trace with hash 670367276, now seen corresponding path program 233 times [2018-12-03 16:55:38,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:38,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:38,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:38,455 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 16:55:38,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:38,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:38,456 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:38,456 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:55:38,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:38,456 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 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:38,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:38,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:38,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:38,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:38,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:38,473 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 16:55:38,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:38,559 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 16:55:38,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:38,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:38,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:38,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:38,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:38,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:38,577 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:38,923 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:55:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:38,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:38,924 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:55:38,924 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:55:38,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:55:39,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 15. [2018-12-03 16:55:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:55:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:55:39,107 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 10 [2018-12-03 16:55:39,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:39,107 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:55:39,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:39,107 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:55:39,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:39,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:39,107 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:55:39,107 INFO L423 AbstractCegarLoop]: === Iteration 248 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:39,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:39,108 INFO L82 PathProgramCache]: Analyzing trace with hash 725717032, now seen corresponding path program 234 times [2018-12-03 16:55:39,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:39,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:39,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:39,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:39,167 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 16:55:39,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:39,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:39,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:39,167 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:55:39,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:39,167 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 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:39,175 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:39,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:39,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:39,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:39,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:39,182 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 16:55:39,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:39,271 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 16:55:39,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:39,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:39,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:39,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:39,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:39,292 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 10 states. [2018-12-03 16:55:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:39,636 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:55:39,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:39,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:39,637 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:55:39,637 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:55:39,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:55:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 16:55:39,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:39,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:39,876 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:39,876 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:39,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:39,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:39,877 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:39,877 INFO L423 AbstractCegarLoop]: === Iteration 249 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:39,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:39,877 INFO L82 PathProgramCache]: Analyzing trace with hash 725718954, now seen corresponding path program 235 times [2018-12-03 16:55:39,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:39,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:39,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:39,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:39,942 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 16:55:39,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:39,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:39,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:39,942 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:55:39,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:39,942 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 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:39,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:39,951 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:39,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:39,970 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 16:55:39,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:40,061 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 16:55:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:40,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:40,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:40,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:40,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:40,082 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:40,422 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:55:40,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:40,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:40,423 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:55:40,423 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:55:40,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:40,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:55:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2018-12-03 16:55:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:40,668 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:40,668 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:40,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:40,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:40,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:40,669 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:40,669 INFO L423 AbstractCegarLoop]: === Iteration 250 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:40,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:40,669 INFO L82 PathProgramCache]: Analyzing trace with hash 725776614, now seen corresponding path program 236 times [2018-12-03 16:55:40,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:40,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:40,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:40,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:40,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:40,748 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 16:55:40,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:40,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:40,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:40,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 16:55:40,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:40,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 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:40,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:40,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:40,764 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:40,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:40,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:40,767 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 16:55:40,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:40,860 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 16:55:40,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:40,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:40,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:40,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:40,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:40,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:40,879 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:41,225 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:55:41,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:41,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:41,226 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:55:41,226 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:55:41,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:55:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 16:55:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:41,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:41,467 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:41,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:41,468 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:41,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:41,468 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:41,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:41,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:41,468 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:55:41,468 INFO L423 AbstractCegarLoop]: === Iteration 251 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:41,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:41,469 INFO L82 PathProgramCache]: Analyzing trace with hash 725778536, now seen corresponding path program 237 times [2018-12-03 16:55:41,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:41,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:41,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:41,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:41,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:41,572 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 16:55:41,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:41,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:41,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:41,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 16:55:41,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:41,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 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:41,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:41,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:41,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:41,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:41,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:41,590 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 16:55:41,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:41,859 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 16:55:41,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:41,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:41,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:41,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:41,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:41,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:41,878 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:42,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:42,199 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:55:42,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:42,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:42,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:42,200 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:55:42,200 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:55:42,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 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 16:55:42,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:55:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2018-12-03 16:55:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:55:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:55:42,410 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 10 [2018-12-03 16:55:42,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:42,411 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:55:42,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:55:42,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:42,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:42,411 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 1, 1, 1] [2018-12-03 16:55:42,411 INFO L423 AbstractCegarLoop]: === Iteration 252 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:42,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:42,411 INFO L82 PathProgramCache]: Analyzing trace with hash 727564074, now seen corresponding path program 238 times [2018-12-03 16:55:42,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:42,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:42,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:42,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:42,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:42,469 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 16:55:42,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:42,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:42,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:42,469 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:55:42,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:42,469 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 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:42,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:42,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:42,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:42,485 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 16:55:42,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:42,621 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 16:55:42,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:42,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:42,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:42,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:42,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:42,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:42,640 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 10 states. [2018-12-03 16:55:42,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:42,961 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:55:42,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:42,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:42,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:42,962 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:55:42,962 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:55:42,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:55:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-12-03 16:55:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:43,195 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:43,195 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:43,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:43,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:43,196 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:55:43,196 INFO L423 AbstractCegarLoop]: === Iteration 253 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:43,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:43,196 INFO L82 PathProgramCache]: Analyzing trace with hash 727565996, now seen corresponding path program 239 times [2018-12-03 16:55:43,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:43,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:43,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:43,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:43,257 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 16:55:43,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:43,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:43,257 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:43,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 16:55:43,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:43,257 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 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:43,266 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:43,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:43,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:43,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:43,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:43,274 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 16:55:43,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:43,360 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 16:55:43,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:43,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:43,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:43,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:43,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:43,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:43,379 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:43,693 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:55:43,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:43,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:43,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:43,694 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:55:43,694 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:55:43,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:55:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2018-12-03 16:55:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:43,926 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 10 [2018-12-03 16:55:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:43,926 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:43,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:43,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:43,926 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2018-12-03 16:55:43,926 INFO L423 AbstractCegarLoop]: === Iteration 254 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:43,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:43,926 INFO L82 PathProgramCache]: Analyzing trace with hash 727623656, now seen corresponding path program 240 times [2018-12-03 16:55:43,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:43,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:43,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:43,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:43,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:44,001 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 16:55:44,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:44,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:44,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:44,002 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:55:44,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:44,002 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 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:44,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:44,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:44,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:44,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:44,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:44,019 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 16:55:44,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:44,108 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 16:55:44,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:44,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:44,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:44,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:44,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:44,129 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 10 states. [2018-12-03 16:55:44,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:44,446 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:55:44,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:44,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:44,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:44,447 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:55:44,447 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:55:44,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:55:44,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2018-12-03 16:55:44,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:44,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:44,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 10 [2018-12-03 16:55:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:44,687 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:44,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:44,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:44,687 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 16:55:44,687 INFO L423 AbstractCegarLoop]: === Iteration 255 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:44,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:44,687 INFO L82 PathProgramCache]: Analyzing trace with hash 727625578, now seen corresponding path program 7 times [2018-12-03 16:55:44,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:44,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:44,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:44,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:44,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:44,760 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 16:55:44,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:44,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:44,760 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:44,761 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:55:44,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:44,761 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 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:44,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:44,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:44,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:44,778 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 16:55:44,778 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:44,862 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 16:55:44,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:44,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:44,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:44,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:44,881 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 10 states. [2018-12-03 16:55:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:45,168 INFO L93 Difference]: Finished difference Result 21 states and 37 transitions. [2018-12-03 16:55:45,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:45,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:45,169 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:55:45,169 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:55:45,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:45,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:55:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2018-12-03 16:55:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:55:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-03 16:55:45,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 10 [2018-12-03 16:55:45,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:45,314 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-03 16:55:45,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:45,314 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-03 16:55:45,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:45,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:45,315 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 16:55:45,315 INFO L423 AbstractCegarLoop]: === Iteration 256 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:45,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:45,315 INFO L82 PathProgramCache]: Analyzing trace with hash -230307328, now seen corresponding path program 8 times [2018-12-03 16:55:45,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:45,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:45,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:45,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:45,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:45,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:45,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:45,405 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:45,406 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:55:45,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:45,406 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 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:45,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:45,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:45,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:45,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:45,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:45,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:46,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:46,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:46,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:46,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:46,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:46,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:46,894 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 11 states. [2018-12-03 16:55:47,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:47,484 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:55:47,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:47,486 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:47,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:47,487 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:55:47,487 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:55:47,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:47,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:55:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:55:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:55:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:55:47,767 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:55:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:47,767 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:55:47,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:55:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:47,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:47,768 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:55:47,768 INFO L423 AbstractCegarLoop]: === Iteration 257 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:47,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash -230305406, now seen corresponding path program 241 times [2018-12-03 16:55:47,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:47,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:47,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:47,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:47,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:47,843 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:47,844 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:55:47,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:47,844 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 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:47,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:47,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:47,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:47,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:47,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:48,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:48,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:48,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:48,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:48,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:48,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:48,014 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:55:48,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:48,605 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:55:48,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:48,606 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:48,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:48,606 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:55:48,606 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:55:48,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:48,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:55:48,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:55:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:48,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:48,881 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:55:48,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:48,881 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:48,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:48,882 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:48,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:48,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:48,882 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:55:48,882 INFO L423 AbstractCegarLoop]: === Iteration 258 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:48,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:48,882 INFO L82 PathProgramCache]: Analyzing trace with hash -230247746, now seen corresponding path program 242 times [2018-12-03 16:55:48,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:48,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:48,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:48,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:48,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:49,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:49,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:49,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:49,117 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:55:49,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:49,117 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 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:49,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:49,125 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:49,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:49,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:49,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:49,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:49,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:49,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:49,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:49,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:49,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:49,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:49,247 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:55:49,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:49,838 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:55:49,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:49,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:49,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:49,839 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:55:49,839 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:55:49,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:55:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:55:50,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:55:50,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:55:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:55:50,116 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:55:50,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:50,116 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:55:50,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:50,117 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:55:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:50,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:50,117 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:55:50,117 INFO L423 AbstractCegarLoop]: === Iteration 259 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:50,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:50,117 INFO L82 PathProgramCache]: Analyzing trace with hash -230245824, now seen corresponding path program 243 times [2018-12-03 16:55:50,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:50,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:50,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:50,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:50,118 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:50,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:50,186 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:50,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:50,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:50,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:50,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:50,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:50,199 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:50,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:50,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:50,202 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:50,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:50,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:50,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:50,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:50,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:50,341 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:55:50,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:50,902 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:55:50,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:50,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:50,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:50,903 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:55:50,903 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:55:50,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:55:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2018-12-03 16:55:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:55:51,161 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:55:51,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:51,161 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:55:51,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:51,161 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:55:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:51,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:51,161 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:55:51,161 INFO L423 AbstractCegarLoop]: === Iteration 260 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:51,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:51,162 INFO L82 PathProgramCache]: Analyzing trace with hash -228460286, now seen corresponding path program 244 times [2018-12-03 16:55:51,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:51,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:51,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:51,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:51,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:51,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:51,231 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:55:51,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:51,232 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 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:51,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:51,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:51,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:51,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:51,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:51,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:51,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:51,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:51,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:51,376 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:55:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:51,982 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:55:51,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:51,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:51,983 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:55:51,983 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:55:51,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:55:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:55:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:55:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:55:52,272 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:55:52,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:52,272 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:55:52,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:52,272 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:55:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:52,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:52,273 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:55:52,273 INFO L423 AbstractCegarLoop]: === Iteration 261 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:52,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash -228458364, now seen corresponding path program 245 times [2018-12-03 16:55:52,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:52,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:52,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:52,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:52,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:52,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:52,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:52,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 16:55:52,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:52,341 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 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:52,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:52,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:52,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:52,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:52,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:52,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:52,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:52,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:52,515 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:55:53,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:53,105 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:55:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:53,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:53,105 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:55:53,106 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:55:53,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:55:53,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:55:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:53,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:53,386 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:55:53,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:53,386 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:53,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:53,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:53,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:53,387 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:55:53,387 INFO L423 AbstractCegarLoop]: === Iteration 262 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:53,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:53,387 INFO L82 PathProgramCache]: Analyzing trace with hash -228400704, now seen corresponding path program 246 times [2018-12-03 16:55:53,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:53,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:53,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:53,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:53,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:53,457 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:53,457 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:53,457 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:53,458 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:55:53,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:53,458 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 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:53,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:53,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:53,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:53,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:53,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:53,479 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:53,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:53,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:53,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:53,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:53,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:53,606 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:55:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:54,167 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:55:54,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:54,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:54,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:54,167 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:55:54,168 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:55:54,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:55:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:55:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:55:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:55:54,450 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:55:54,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:54,450 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:55:54,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:54,450 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:55:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:54,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:54,451 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:55:54,451 INFO L423 AbstractCegarLoop]: === Iteration 263 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:54,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:54,451 INFO L82 PathProgramCache]: Analyzing trace with hash -228398782, now seen corresponding path program 247 times [2018-12-03 16:55:54,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:54,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:54,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:54,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:54,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:54,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:54,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:54,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:54,529 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:54,530 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:55:54,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:54,530 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 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:54,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:54,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:54,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:54,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:54,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:54,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:54,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:54,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:54,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:54,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:54,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:54,760 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:55:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:55,334 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:55:55,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:55,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:55,334 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:55:55,335 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:55:55,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:55,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:55:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-12-03 16:55:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:55:55,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:55:55,600 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:55:55,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:55,600 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:55:55,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:55,600 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:55:55,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:55,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:55,600 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:55:55,600 INFO L423 AbstractCegarLoop]: === Iteration 264 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:55,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:55,601 INFO L82 PathProgramCache]: Analyzing trace with hash -173049026, now seen corresponding path program 248 times [2018-12-03 16:55:55,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:55,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:55,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:55,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:55,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:55,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:55,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:55,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:55,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:55,690 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:55:55,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:55,690 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 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:55,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:55,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:55,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:55,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:55,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:55,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:55,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:55,824 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:55,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:55,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:55,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:55,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:55,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:55,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:55,845 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:55:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:56,416 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:55:56,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:56,416 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:56,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:56,417 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:55:56,417 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:55:56,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:56,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:55:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:55:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:55:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:55:56,700 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:55:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:56,701 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:55:56,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:55:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:56,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:56,701 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:55:56,701 INFO L423 AbstractCegarLoop]: === Iteration 265 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:56,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:56,701 INFO L82 PathProgramCache]: Analyzing trace with hash -173047104, now seen corresponding path program 249 times [2018-12-03 16:55:56,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:56,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:56,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:56,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:56,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:56,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:56,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:56,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:56,770 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:56,770 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:55:56,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:56,770 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 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:56,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:56,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:56,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:56,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:56,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:56,790 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:56,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:57,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:57,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:57,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:57,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:57,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:57,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:57,166 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:55:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:57,718 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:55:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:57,718 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:57,719 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:55:57,719 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:55:57,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:55:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:55:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:58,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:55:58,002 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:55:58,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:58,002 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:55:58,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:55:58,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:58,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:58,002 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:55:58,002 INFO L423 AbstractCegarLoop]: === Iteration 266 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:58,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:58,003 INFO L82 PathProgramCache]: Analyzing trace with hash -172989444, now seen corresponding path program 250 times [2018-12-03 16:55:58,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:58,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:58,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:58,074 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:58,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:58,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:58,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:58,075 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:55:58,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:58,075 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 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:58,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:58,083 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:58,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:58,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:58,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:58,195 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:58,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:58,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:58,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:58,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:58,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:58,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:58,215 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:55:58,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:58,782 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:55:58,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:58,782 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:58,782 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:55:58,783 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:55:58,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:58,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:55:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:55:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:55:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:55:59,087 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:55:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:59,087 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:55:59,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:59,087 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:55:59,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:59,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:59,087 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:55:59,087 INFO L423 AbstractCegarLoop]: === Iteration 267 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:59,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:59,088 INFO L82 PathProgramCache]: Analyzing trace with hash -172987522, now seen corresponding path program 251 times [2018-12-03 16:55:59,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:59,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:59,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:59,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:59,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:59,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:59,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:59,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:59,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:59,156 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:55:59,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:59,157 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 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:59,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:59,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:59,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:59,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:59,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:59,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:59,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:59,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:59,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:59,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:59,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:59,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:59,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:59,319 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:55:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:59,880 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:55:59,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:59,880 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:59,881 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:55:59,881 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:55:59,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:59,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:56:00,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-12-03 16:56:00,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:56:00,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:56:00,154 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:56:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:00,154 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:56:00,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:56:00,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:00,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:00,155 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:00,155 INFO L423 AbstractCegarLoop]: === Iteration 268 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:00,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash -171201984, now seen corresponding path program 252 times [2018-12-03 16:56:00,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:00,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:00,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:00,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:00,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:00,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:00,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:00,235 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:00,235 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:56:00,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:00,235 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 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:00,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:00,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:00,249 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:00,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:00,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:00,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:00,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:00,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:00,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:00,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:00,389 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:56:00,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:00,921 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:56:00,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:00,921 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:00,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:00,922 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:56:00,922 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:56:00,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:00,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:56:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 16:56:01,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:01,210 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:01,210 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:01,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:01,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:01,210 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:01,211 INFO L423 AbstractCegarLoop]: === Iteration 269 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:01,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:01,211 INFO L82 PathProgramCache]: Analyzing trace with hash -171200062, now seen corresponding path program 253 times [2018-12-03 16:56:01,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:01,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:01,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:01,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:01,294 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:01,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:01,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:01,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:01,295 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:56:01,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:01,295 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 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:01,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:01,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:01,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:01,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:01,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:01,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:01,431 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:01,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:01,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:01,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:01,432 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:01,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:01,963 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:56:01,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:01,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:01,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:01,963 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:56:01,964 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:56:01,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:56:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:56:02,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:02,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:02,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:02,268 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:02,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:02,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:02,268 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:02,269 INFO L423 AbstractCegarLoop]: === Iteration 270 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:02,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash -171142402, now seen corresponding path program 254 times [2018-12-03 16:56:02,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:02,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:02,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:02,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:02,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:02,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:02,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:02,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:02,380 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:56:02,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:02,380 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 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:02,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:02,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:02,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:02,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:02,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:02,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:02,497 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:02,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:02,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:02,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:02,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:02,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:02,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:02,517 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:03,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:03,021 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:56:03,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:03,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:03,022 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:56:03,022 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:56:03,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:03,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:56:03,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:56:03,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:03,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:03,317 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:03,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:03,317 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:03,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:03,317 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:03,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:03,317 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:03,317 INFO L423 AbstractCegarLoop]: === Iteration 271 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:03,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash -171140480, now seen corresponding path program 255 times [2018-12-03 16:56:03,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:03,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:03,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:03,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:03,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:03,384 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:03,384 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:03,384 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:56:03,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:03,384 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 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:03,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:03,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:03,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:03,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:03,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:03,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:03,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:03,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:03,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:03,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:03,531 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:04,024 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:56:04,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:04,024 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:04,024 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:56:04,024 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:56:04,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:56:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 16:56:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:56:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:56:04,256 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 16:56:04,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:04,256 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:56:04,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:56:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:04,256 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:04,256 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:56:04,256 INFO L423 AbstractCegarLoop]: === Iteration 272 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:04,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:04,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1544700034, now seen corresponding path program 256 times [2018-12-03 16:56:04,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:04,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:04,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:04,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:04,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:04,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:04,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:04,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:04,336 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:56:04,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:04,336 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 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:04,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:04,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:04,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:04,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:04,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:04,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:04,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:04,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:04,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:04,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:04,474 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 16:56:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:05,123 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:56:05,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:05,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:05,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:05,124 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:56:05,124 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:56:05,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:05,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:56:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:56:05,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:05,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:05,433 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:05,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:05,433 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:05,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:05,433 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:05,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:05,433 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:05,434 INFO L423 AbstractCegarLoop]: === Iteration 273 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:05,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:05,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1544701956, now seen corresponding path program 257 times [2018-12-03 16:56:05,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:05,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:05,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:05,434 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:05,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:05,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:05,499 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:05,499 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:56:05,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:05,499 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 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:05,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:05,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:05,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:05,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:05,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:05,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:05,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:05,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:05,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:05,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:05,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:05,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:05,662 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:06,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:06,302 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:56:06,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:06,302 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:06,302 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:56:06,303 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:56:06,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:56:06,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:56:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:06,593 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:06,593 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:06,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:06,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:06,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:06,593 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:06,593 INFO L423 AbstractCegarLoop]: === Iteration 274 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:06,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:06,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1544759616, now seen corresponding path program 258 times [2018-12-03 16:56:06,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:06,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:06,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:06,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:06,660 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:06,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:06,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:06,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:06,661 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:56:06,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:06,661 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 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:06,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:06,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:06,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:06,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:06,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:06,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:06,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:06,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:06,813 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:06,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:06,814 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:07,430 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:56:07,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:07,430 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:07,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:07,430 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:56:07,431 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:56:07,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:07,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:56:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:56:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:07,727 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:07,727 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:07,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:07,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:07,727 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:07,728 INFO L423 AbstractCegarLoop]: === Iteration 275 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:07,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:07,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1544761538, now seen corresponding path program 259 times [2018-12-03 16:56:07,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:07,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:07,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:07,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:07,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:07,795 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:07,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:07,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:07,795 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:07,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 16:56:07,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:07,796 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 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:07,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:07,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:07,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:07,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:07,933 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:07,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:07,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:07,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:07,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:07,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:07,952 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:08,538 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:56:08,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:08,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:08,538 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:56:08,539 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:56:08,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:08,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:56:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2018-12-03 16:56:08,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:56:08,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:56:08,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:56:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:08,814 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:56:08,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:08,814 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:56:08,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:08,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:08,814 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:08,815 INFO L423 AbstractCegarLoop]: === Iteration 276 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:08,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:08,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1546547076, now seen corresponding path program 260 times [2018-12-03 16:56:08,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:08,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:08,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:08,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:08,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:08,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:08,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:08,897 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:08,897 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:56:08,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:08,897 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 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:08,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:08,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:08,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:08,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:08,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:08,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:09,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:09,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:09,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:09,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:09,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:09,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:09,055 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:56:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:09,704 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:56:09,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:09,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:09,705 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:56:09,705 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:56:09,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:56:10,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:56:10,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:10,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:10,006 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:10,006 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:10,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:10,006 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:10,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:10,007 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:10,007 INFO L423 AbstractCegarLoop]: === Iteration 277 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:10,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1546548998, now seen corresponding path program 261 times [2018-12-03 16:56:10,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:10,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:10,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:10,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:10,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:10,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:10,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:10,070 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:10,070 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:56:10,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:10,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 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:10,082 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:10,082 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:10,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:10,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:10,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:10,091 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:10,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:10,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:10,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:10,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:10,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:10,220 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:10,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:10,876 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:56:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:10,876 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:10,877 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:56:10,877 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:56:10,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:56:11,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:56:11,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:11,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:11,187 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:11,187 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:11,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:11,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:11,187 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:11,187 INFO L423 AbstractCegarLoop]: === Iteration 278 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:11,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1546606658, now seen corresponding path program 262 times [2018-12-03 16:56:11,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:11,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:11,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:11,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:11,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:11,257 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:11,257 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:11,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 16:56:11,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:11,257 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 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:11,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:11,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:11,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:11,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:11,432 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:11,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:11,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:11,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:11,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:11,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:11,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:11,452 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:12,082 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:56:12,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:12,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:12,083 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:56:12,083 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:56:12,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:56:12,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:56:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:12,387 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:12,387 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:12,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:12,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:12,387 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:12,387 INFO L423 AbstractCegarLoop]: === Iteration 279 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:12,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1546608580, now seen corresponding path program 263 times [2018-12-03 16:56:12,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:12,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:12,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:12,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:12,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:12,520 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:12,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:12,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:12,520 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:12,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:12,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:12,521 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 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:12,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:12,531 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:12,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:12,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:12,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:12,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:12,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:12,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:12,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:12,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:12,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:12,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:12,672 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:13,261 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:56:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:13,261 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:13,262 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:56:13,262 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:56:13,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:56:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-12-03 16:56:13,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:56:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:56:13,515 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:56:13,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:13,515 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:56:13,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:56:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:13,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:13,516 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:13,516 INFO L423 AbstractCegarLoop]: === Iteration 280 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:13,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:13,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1601958336, now seen corresponding path program 264 times [2018-12-03 16:56:13,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:13,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:13,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:13,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:13,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:13,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:13,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:13,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:13,599 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:56:13,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:13,599 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 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:13,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:13,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:13,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:13,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:13,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:13,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:13,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:13,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:13,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:13,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:13,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:13,739 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:56:14,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:14,335 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:56:14,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:14,335 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:14,336 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:56:14,336 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:56:14,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:14,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:56:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:56:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:14,652 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:14,652 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:14,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:14,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:14,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:14,652 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:14,652 INFO L423 AbstractCegarLoop]: === Iteration 281 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:14,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:14,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1601960258, now seen corresponding path program 265 times [2018-12-03 16:56:14,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:14,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:14,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:14,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:14,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:14,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:14,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:14,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:14,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:14,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:14,722 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 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:14,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:14,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:14,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:14,738 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:14,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:14,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:14,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:14,878 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:14,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:14,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:14,879 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:15,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:15,463 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:56:15,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:15,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:15,463 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:56:15,463 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:56:15,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:15,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:56:15,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:56:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:15,758 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:15,758 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:15,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:15,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:15,759 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:15,759 INFO L423 AbstractCegarLoop]: === Iteration 282 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:15,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:15,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1602017918, now seen corresponding path program 266 times [2018-12-03 16:56:15,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:15,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:15,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:15,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:15,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:15,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:15,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:15,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:15,828 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:56:15,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:15,829 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 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:15,837 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:15,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:15,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:15,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:15,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:15,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:15,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:15,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:15,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:15,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:15,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:15,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:15,988 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:16,602 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:56:16,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:16,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:16,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:16,603 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:56:16,603 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:56:16,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:56:16,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:56:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:16,920 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:16,920 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:16,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:16,920 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:16,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:16,921 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:16,921 INFO L423 AbstractCegarLoop]: === Iteration 283 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:16,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:16,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1602019840, now seen corresponding path program 267 times [2018-12-03 16:56:16,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:16,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:16,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:16,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:16,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:16,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:16,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:16,987 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:16,987 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:56:16,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:16,987 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 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:16,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:16,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:17,003 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:17,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:17,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:17,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:17,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:17,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:17,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:17,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:17,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:17,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:17,153 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:17,737 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:56:17,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:17,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:17,738 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:56:17,738 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:56:17,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:56:18,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-12-03 16:56:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:56:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:56:18,016 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:56:18,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:18,016 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:56:18,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:18,016 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:56:18,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:18,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:18,016 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:18,016 INFO L423 AbstractCegarLoop]: === Iteration 284 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:18,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:18,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1603805378, now seen corresponding path program 268 times [2018-12-03 16:56:18,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:18,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:18,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:18,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:18,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:18,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:18,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:18,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:18,084 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:56:18,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:18,084 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 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:18,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:18,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:18,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:18,102 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:18,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:18,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:18,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:18,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:18,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:18,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:18,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:18,243 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:56:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:18,797 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:56:18,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:18,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:18,798 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:56:18,798 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:56:18,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:18,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:56:19,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 16:56:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:19,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:19,113 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:19,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:19,113 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:19,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:19,113 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:19,113 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:19,113 INFO L423 AbstractCegarLoop]: === Iteration 285 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:19,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1603807300, now seen corresponding path program 269 times [2018-12-03 16:56:19,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:19,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:19,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:19,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:19,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:19,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:19,744 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:56:19,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:19,744 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 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:19,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:19,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:19,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:19,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:19,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:19,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:19,861 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:19,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:19,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:19,879 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:19,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:19,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:19,880 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:20,445 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:56:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:20,445 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:20,446 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:56:20,446 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:56:20,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:56:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:56:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:20,767 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:20,767 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:20,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:20,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:20,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:20,767 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:20,768 INFO L423 AbstractCegarLoop]: === Iteration 286 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:20,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:20,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1603864960, now seen corresponding path program 270 times [2018-12-03 16:56:20,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:20,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:20,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:20,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:20,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:20,856 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:20,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:20,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:20,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:20,857 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:56:20,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:20,857 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 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:20,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:20,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:20,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:20,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:20,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:20,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:20,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:20,983 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:21,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:21,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:21,003 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:21,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:21,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:21,003 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:21,519 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:56:21,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:21,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:21,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:21,520 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:56:21,520 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:56:21,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:21,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:56:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:56:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:21,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:21,841 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:21,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:21,841 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:21,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:21,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:21,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:21,841 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:21,841 INFO L423 AbstractCegarLoop]: === Iteration 287 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:21,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:21,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1603866882, now seen corresponding path program 271 times [2018-12-03 16:56:21,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:21,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:21,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:21,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:21,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:21,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:21,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:21,908 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:56:21,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:21,908 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 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:21,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:21,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:21,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:21,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:22,035 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:22,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:22,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:22,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:22,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:22,053 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:22,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:22,530 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:56:22,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:22,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:22,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:22,531 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:56:22,531 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:56:22,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:56:22,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2018-12-03 16:56:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:56:22,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:56:22,737 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 11 [2018-12-03 16:56:22,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:22,737 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:56:22,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:56:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:22,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:22,737 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:56:22,738 INFO L423 AbstractCegarLoop]: === Iteration 288 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:22,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:22,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1039653954, now seen corresponding path program 272 times [2018-12-03 16:56:22,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:22,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:22,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:22,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:22,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:22,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:22,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:22,839 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:56:22,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:22,840 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 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:22,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:22,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:22,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:22,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:22,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:22,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:22,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:22,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:22,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:22,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:22,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:22,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:22,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:22,982 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 11 states. [2018-12-03 16:56:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:23,584 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:56:23,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:23,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:23,585 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:56:23,585 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:56:23,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:23,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:56:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:56:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:23,914 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:23,914 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:23,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:23,914 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:23,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:23,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:23,914 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:23,914 INFO L423 AbstractCegarLoop]: === Iteration 289 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:23,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:23,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1039652032, now seen corresponding path program 273 times [2018-12-03 16:56:23,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:23,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:23,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:23,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:23,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:23,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:23,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:23,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:23,981 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:56:23,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:23,981 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 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:23,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:23,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:23,996 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:23,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:23,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:23,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:23,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:24,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:24,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:24,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:24,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:24,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:24,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:24,125 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:24,701 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:56:24,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:24,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:24,702 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:56:24,702 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:56:24,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:56:25,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:56:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:25,015 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:25,015 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:25,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:25,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:25,016 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:25,016 INFO L423 AbstractCegarLoop]: === Iteration 290 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:25,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:25,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1039594372, now seen corresponding path program 274 times [2018-12-03 16:56:25,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:25,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:25,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:25,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:25,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:25,094 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:25,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:25,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:25,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:25,095 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:56:25,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:25,095 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 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:25,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:25,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:25,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:25,111 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:25,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:25,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:25,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:25,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:25,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:25,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:25,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:25,286 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:25,902 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:56:25,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:25,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:25,903 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:56:25,903 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:56:25,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:56:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:56:26,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:26,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:26,238 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:26,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:26,238 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:26,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:26,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:26,239 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:26,239 INFO L423 AbstractCegarLoop]: === Iteration 291 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:26,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1039592450, now seen corresponding path program 275 times [2018-12-03 16:56:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:26,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:26,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:26,312 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:26,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:26,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:26,312 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:26,312 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:56:26,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:26,312 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 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:26,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:26,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:26,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:26,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:26,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:26,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:26,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:26,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:26,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:26,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:26,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:26,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:26,489 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:27,095 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:56:27,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:27,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:27,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:27,096 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:56:27,096 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:56:27,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:56:27,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 16:56:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:56:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:56:27,394 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:56:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:27,394 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:56:27,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:56:27,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:27,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:27,395 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:27,395 INFO L423 AbstractCegarLoop]: === Iteration 292 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:27,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:27,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1037806912, now seen corresponding path program 276 times [2018-12-03 16:56:27,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:27,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:27,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:27,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:27,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:27,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:27,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:27,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:27,462 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:56:27,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:27,462 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 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:27,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:27,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:27,477 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:27,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:27,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:27,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:27,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:27,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:27,706 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:27,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:27,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:27,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:27,706 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:56:28,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:28,270 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:56:28,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:28,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:28,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:28,271 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:56:28,271 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:56:28,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:56:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:56:28,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:28,610 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:28,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:28,610 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:28,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:28,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:28,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:28,610 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:28,610 INFO L423 AbstractCegarLoop]: === Iteration 293 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:28,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:28,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1037804990, now seen corresponding path program 277 times [2018-12-03 16:56:28,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:28,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:28,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:28,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:28,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:28,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:28,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:28,684 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:28,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 16:56:28,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:28,685 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 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:28,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:28,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:28,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:28,724 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:28,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:28,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:28,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:28,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:28,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:28,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:28,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:28,876 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:29,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:29,437 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:56:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:29,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:29,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:29,438 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:56:29,438 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:56:29,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:56:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 16:56:29,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:29,771 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:29,771 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:29,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:29,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:29,772 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:29,772 INFO L423 AbstractCegarLoop]: === Iteration 294 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:29,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:29,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1037747330, now seen corresponding path program 278 times [2018-12-03 16:56:29,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:29,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:29,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:29,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:29,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:29,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:29,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:29,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:29,839 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:56:29,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:29,839 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 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:29,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:29,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:29,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:29,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:29,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:29,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:29,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:29,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:29,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:29,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:29,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:29,986 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:30,500 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:56:30,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:30,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:30,501 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:56:30,501 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:56:30,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:56:30,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 16:56:30,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:30,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:30,829 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:30,829 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:30,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:30,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:30,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:30,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:30,830 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:30,830 INFO L423 AbstractCegarLoop]: === Iteration 295 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:30,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1037745408, now seen corresponding path program 279 times [2018-12-03 16:56:30,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:30,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:30,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:30,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:30,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:30,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:30,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:30,897 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:30,897 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:56:30,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:30,897 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 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:30,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:30,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:30,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:30,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:30,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:30,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:31,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:31,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:31,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:31,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:31,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:31,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:31,047 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:31,570 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:56:31,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:31,570 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:31,571 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:56:31,571 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:56:31,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:31,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:56:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 16:56:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:56:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:56:31,855 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:56:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:31,855 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:56:31,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:56:31,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:31,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:31,856 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:31,856 INFO L423 AbstractCegarLoop]: === Iteration 296 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:31,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:31,856 INFO L82 PathProgramCache]: Analyzing trace with hash -982395652, now seen corresponding path program 280 times [2018-12-03 16:56:31,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:31,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:31,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:31,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:31,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:31,926 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:31,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:31,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:31,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:31,927 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:56:31,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:31,927 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 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:31,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:31,936 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:31,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:31,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:32,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:32,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:32,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:32,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:32,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:32,095 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:56:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:32,725 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:56:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:32,725 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:32,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:32,725 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:56:32,726 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:56:32,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:32,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:56:33,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:56:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:33,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:33,088 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:33,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:33,089 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:33,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:33,089 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:33,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:33,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:33,089 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:33,089 INFO L423 AbstractCegarLoop]: === Iteration 297 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:33,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:33,089 INFO L82 PathProgramCache]: Analyzing trace with hash -982393730, now seen corresponding path program 281 times [2018-12-03 16:56:33,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:33,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:33,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:33,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:33,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:33,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:33,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:33,171 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:56:33,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:33,171 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 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:33,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:33,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:33,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:33,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:33,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:33,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:33,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:33,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:33,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:33,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:33,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:33,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:33,323 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:33,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:33,934 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:56:33,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:33,934 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:33,935 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:56:33,935 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:56:33,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:56:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:56:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:34,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:34,251 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:34,251 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:34,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:34,251 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:34,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:34,252 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:34,252 INFO L423 AbstractCegarLoop]: === Iteration 298 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:34,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash -982336070, now seen corresponding path program 282 times [2018-12-03 16:56:34,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:34,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:34,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:34,253 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:34,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:34,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:34,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:34,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:34,319 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:56:34,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:34,319 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 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:34,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:34,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:34,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:34,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:34,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:34,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:34,479 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:34,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:34,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:34,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:34,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:34,499 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:35,154 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:56:35,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:35,154 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:35,155 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:56:35,155 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:56:35,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:56:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:56:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:35,484 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:35,484 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:35,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:35,484 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:35,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:35,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:35,485 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:35,485 INFO L423 AbstractCegarLoop]: === Iteration 299 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:35,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:35,485 INFO L82 PathProgramCache]: Analyzing trace with hash -982334148, now seen corresponding path program 283 times [2018-12-03 16:56:35,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:35,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:35,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:35,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:35,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:35,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:35,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:35,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 16:56:35,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:35,552 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 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:35,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:35,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:35,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:35,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:35,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:35,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:35,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:35,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:35,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:35,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:35,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:35,696 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:36,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:36,309 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:56:36,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:36,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:36,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:36,309 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:56:36,310 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:56:36,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:56:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 16:56:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:56:36,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:56:36,611 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:56:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:36,611 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:56:36,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:56:36,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:36,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:36,612 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:36,612 INFO L423 AbstractCegarLoop]: === Iteration 300 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:36,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash -980548610, now seen corresponding path program 284 times [2018-12-03 16:56:36,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:36,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:36,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:36,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:36,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:36,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:36,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:36,683 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:36,683 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:56:36,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:36,683 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 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:36,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:36,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:36,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:36,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:36,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:36,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:36,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:36,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:36,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:36,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:36,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:36,839 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:56:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:37,404 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:56:37,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:37,405 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:37,405 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:56:37,405 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:56:37,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:56:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:56:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:37,749 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:37,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:37,749 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:37,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:37,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:37,749 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:37,750 INFO L423 AbstractCegarLoop]: === Iteration 301 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:37,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash -980546688, now seen corresponding path program 285 times [2018-12-03 16:56:37,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:37,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:37,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:37,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:37,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:37,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:37,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:37,819 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:56:37,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:37,819 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 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:37,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:37,826 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:37,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:37,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:37,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:37,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:38,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:38,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:38,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:38,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:38,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:38,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:38,033 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:38,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:38,613 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:56:38,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:38,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:38,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:38,614 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:56:38,614 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:56:38,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:56:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 16:56:38,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:38,940 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:38,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:38,941 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:38,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:38,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:38,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:38,941 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:38,941 INFO L423 AbstractCegarLoop]: === Iteration 302 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:38,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash -980489028, now seen corresponding path program 286 times [2018-12-03 16:56:38,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:38,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:38,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:38,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:39,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:39,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:39,038 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:39,038 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:56:39,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:39,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 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:39,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:39,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:39,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:39,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:39,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:39,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:39,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:39,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:39,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:39,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:39,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:39,799 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:40,361 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:56:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:40,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:40,362 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:56:40,362 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:56:40,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:56:40,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 16:56:40,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:40,691 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:40,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:40,691 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:40,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:40,692 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:40,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:40,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:40,692 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:40,692 INFO L423 AbstractCegarLoop]: === Iteration 303 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:40,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash -980487106, now seen corresponding path program 287 times [2018-12-03 16:56:40,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:40,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:40,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:40,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:40,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:40,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:40,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:40,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 16:56:40,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:40,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 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:40,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:40,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:40,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:40,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:40,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:40,783 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:40,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:40,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:40,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:40,912 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:40,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:40,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:40,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:40,913 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:41,450 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:56:41,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:41,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:41,451 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:56:41,451 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:56:41,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:56:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-12-03 16:56:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:56:41,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:56:41,704 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 16:56:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:41,704 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:56:41,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:56:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:41,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:41,704 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:41,704 INFO L423 AbstractCegarLoop]: === Iteration 304 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:41,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:41,705 INFO L82 PathProgramCache]: Analyzing trace with hash 735353408, now seen corresponding path program 288 times [2018-12-03 16:56:41,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:41,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:41,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:41,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:41,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:41,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:41,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:41,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:41,775 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:56:41,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:41,775 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 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:41,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:41,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:41,787 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:41,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:41,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:41,791 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:41,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:41,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:41,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:41,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:41,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:41,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:41,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:41,922 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 16:56:42,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:42,465 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:56:42,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:42,465 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:42,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:42,466 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:56:42,466 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:56:42,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:42,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:56:42,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 16:56:42,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:42,804 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:42,804 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:42,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:42,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:42,805 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:42,805 INFO L423 AbstractCegarLoop]: === Iteration 305 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:42,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:42,806 INFO L82 PathProgramCache]: Analyzing trace with hash 735355330, now seen corresponding path program 289 times [2018-12-03 16:56:42,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:42,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:42,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:42,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:42,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:42,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:42,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:42,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:42,955 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:56:42,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:42,956 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 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:42,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:42,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:42,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:42,974 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:42,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:43,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:43,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:43,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:43,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:43,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:43,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:43,267 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:43,818 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:56:43,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:43,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:43,819 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:56:43,819 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:56:43,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:43,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:56:44,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 16:56:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:44,162 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:44,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:44,162 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:44,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:44,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:44,162 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:44,162 INFO L423 AbstractCegarLoop]: === Iteration 306 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:44,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 735412990, now seen corresponding path program 290 times [2018-12-03 16:56:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:44,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:44,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:44,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:44,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:44,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:44,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:44,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:44,232 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:56:44,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:44,232 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 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:44,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:44,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:44,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:44,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:44,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:44,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:44,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:44,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:44,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:44,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:44,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:44,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:44,377 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:44,904 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:56:44,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:44,904 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:44,904 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:56:44,904 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:56:44,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:56:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-12-03 16:56:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:45,240 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:45,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:45,240 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:45,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:45,240 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:45,241 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:45,241 INFO L423 AbstractCegarLoop]: === Iteration 307 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:45,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:45,241 INFO L82 PathProgramCache]: Analyzing trace with hash 735414912, now seen corresponding path program 291 times [2018-12-03 16:56:45,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:45,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:45,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:45,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:45,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:45,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:45,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:45,367 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:45,367 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:56:45,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:45,367 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 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:45,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:45,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:45,382 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:45,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:45,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:45,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:45,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:45,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:45,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:45,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:45,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:45,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:45,500 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:46,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:46,010 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:56:46,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:46,010 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:46,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:46,011 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:56:46,011 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:56:46,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:56:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:56:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:56:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:56:46,320 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:56:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:46,320 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:56:46,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:56:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:46,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:46,321 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:46,321 INFO L423 AbstractCegarLoop]: === Iteration 308 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:46,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:46,321 INFO L82 PathProgramCache]: Analyzing trace with hash 737200450, now seen corresponding path program 292 times [2018-12-03 16:56:46,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:46,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:46,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:46,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:46,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:46,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:46,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:46,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:46,389 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:56:46,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:46,389 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 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:46,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:46,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:46,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:46,405 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:46,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:46,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:46,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:46,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:46,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:46,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:46,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:46,578 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:56:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:47,137 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:56:47,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:47,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:47,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:47,137 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:56:47,137 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:56:47,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:47,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:56:47,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 16:56:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:47,481 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:47,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:47,481 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:47,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:47,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:47,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:47,482 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:47,482 INFO L423 AbstractCegarLoop]: === Iteration 309 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:47,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:47,482 INFO L82 PathProgramCache]: Analyzing trace with hash 737202372, now seen corresponding path program 293 times [2018-12-03 16:56:47,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:47,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:47,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:47,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:47,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:47,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:47,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:47,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:47,553 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:56:47,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:47,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 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:47,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:47,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:47,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:47,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:47,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:47,572 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:47,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:47,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:47,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:47,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:47,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:47,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:47,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:47,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:47,708 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:48,253 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:56:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:48,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:48,253 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:56:48,253 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:56:48,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:48,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:56:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 16:56:48,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:48,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:48,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:48,588 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:48,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:48,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:48,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:48,588 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:48,588 INFO L423 AbstractCegarLoop]: === Iteration 310 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:48,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:48,589 INFO L82 PathProgramCache]: Analyzing trace with hash 737260032, now seen corresponding path program 294 times [2018-12-03 16:56:48,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:48,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:48,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:48,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:48,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:48,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:48,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:48,662 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:56:48,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:48,662 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 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:48,671 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:48,671 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:48,676 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:48,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:48,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:48,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:48,794 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:48,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:48,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:48,813 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:48,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:48,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:48,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:48,814 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:49,334 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:56:49,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:49,334 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:49,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:49,335 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:56:49,335 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:56:49,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:56:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-12-03 16:56:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:49,672 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:49,672 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:49,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:49,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:49,673 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:49,673 INFO L423 AbstractCegarLoop]: === Iteration 311 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:49,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:49,673 INFO L82 PathProgramCache]: Analyzing trace with hash 737261954, now seen corresponding path program 295 times [2018-12-03 16:56:49,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:49,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:49,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:49,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:49,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:49,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:49,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:49,742 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:49,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 16:56:49,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:49,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 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:49,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:49,752 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:49,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:49,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:49,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:49,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:49,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:49,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:49,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:49,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:49,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:49,901 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:50,395 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:56:50,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:50,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:50,395 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:56:50,395 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:56:50,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:56:50,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 16:56:50,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:56:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:56:50,686 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:56:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:50,686 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:56:50,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:56:50,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:50,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:50,687 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:50,687 INFO L423 AbstractCegarLoop]: === Iteration 312 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:50,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:50,687 INFO L82 PathProgramCache]: Analyzing trace with hash 792611710, now seen corresponding path program 296 times [2018-12-03 16:56:50,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:50,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:50,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:50,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:50,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:50,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:50,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:50,756 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:50,756 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:56:50,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:50,756 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 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:50,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:50,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:50,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:50,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:50,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:50,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:50,899 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:50,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:50,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:50,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:50,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:50,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:50,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:50,919 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:56:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:51,429 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:56:51,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:51,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:51,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:51,430 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:56:51,430 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:56:51,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:51,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:56:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 16:56:51,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:51,790 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:51,790 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:51,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:51,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:51,791 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:51,791 INFO L423 AbstractCegarLoop]: === Iteration 313 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:51,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:51,791 INFO L82 PathProgramCache]: Analyzing trace with hash 792613632, now seen corresponding path program 297 times [2018-12-03 16:56:51,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:51,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:51,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:51,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:51,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:51,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:51,860 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:56:51,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:51,860 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 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:51,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:51,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:51,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:51,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:51,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:51,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:52,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:52,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:52,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:52,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:52,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:52,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:52,004 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:52,474 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:56:52,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:52,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:52,475 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:56:52,475 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:56:52,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:52,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:56:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 16:56:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:52,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:52,826 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:52,826 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:52,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:52,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:52,827 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:52,827 INFO L423 AbstractCegarLoop]: === Iteration 314 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:52,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash 792671292, now seen corresponding path program 298 times [2018-12-03 16:56:52,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:52,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:52,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:52,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:52,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:52,893 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:52,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:52,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:52,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:52,894 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:56:52,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:52,894 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 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:52,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:52,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:52,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:52,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:53,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:53,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:53,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:53,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:53,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:53,071 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:53,556 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:56:53,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:53,557 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:53,557 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:56:53,557 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:56:53,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:53,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:56:53,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 16:56:53,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:53,904 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:53,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:53,904 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:53,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:53,904 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:53,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:53,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:53,904 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:53,905 INFO L423 AbstractCegarLoop]: === Iteration 315 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:53,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:53,905 INFO L82 PathProgramCache]: Analyzing trace with hash 792673214, now seen corresponding path program 299 times [2018-12-03 16:56:53,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:53,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:53,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:53,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:53,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:54,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:54,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:54,031 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:54,032 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:56:54,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:54,032 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 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:54,040 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:54,040 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:54,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:54,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:54,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:54,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:54,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:54,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:54,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:54,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:54,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:54,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:54,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:54,169 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:54,639 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:56:54,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:54,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:54,640 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:56:54,640 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:56:54,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:54,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:56:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 16:56:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:56:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:56:54,952 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:56:54,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:54,952 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:56:54,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:54,952 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:56:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:54,952 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:54,952 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:56:54,952 INFO L423 AbstractCegarLoop]: === Iteration 316 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:54,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:54,952 INFO L82 PathProgramCache]: Analyzing trace with hash 794458752, now seen corresponding path program 300 times [2018-12-03 16:56:54,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:54,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:54,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:54,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:55,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:55,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:55,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:55,024 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:56:55,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:55,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:55,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:55,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:55,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:55,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:55,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:55,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:55,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:55,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:55,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:55,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:55,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:55,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:55,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:55,161 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:56:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:55,614 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:56:55,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:55,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:55,615 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:56:55,615 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:56:55,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:55,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:56:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-12-03 16:56:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:55,973 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:55,973 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:55,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:55,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:55,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:55,973 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:55,974 INFO L423 AbstractCegarLoop]: === Iteration 317 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:55,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:55,974 INFO L82 PathProgramCache]: Analyzing trace with hash 794460674, now seen corresponding path program 301 times [2018-12-03 16:56:55,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:55,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:55,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:55,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:56,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:56,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:56,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:56,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:56,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:56,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:56,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:56,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:56,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:56,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:56,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:56,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:56,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:56,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:56,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:56,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:56,185 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:56,639 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:56:56,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:56,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:56,640 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:56:56,640 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:56:56,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:56:57,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-03 16:56:57,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:56:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:56:57,009 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:56:57,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:57,009 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:56:57,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:57,010 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:56:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:57,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:57,010 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:56:57,010 INFO L423 AbstractCegarLoop]: === Iteration 318 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:57,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:57,010 INFO L82 PathProgramCache]: Analyzing trace with hash 794518334, now seen corresponding path program 302 times [2018-12-03 16:56:57,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:57,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:57,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:57,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:57,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:57,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:57,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:57,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:57,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:56:57,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:57,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 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:57,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:57,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:57,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:56:57,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:57,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:57,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:57,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:57,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:57,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:57,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:57,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:57,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:57,223 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:56:57,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:57,657 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:56:57,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:57,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:57,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:57,658 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:56:57,658 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:56:57,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:57,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:56:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-03 16:56:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:56:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:56:58,010 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:56:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:58,010 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:56:58,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:56:58,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:58,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:58,011 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:56:58,011 INFO L423 AbstractCegarLoop]: === Iteration 319 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:58,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:58,011 INFO L82 PathProgramCache]: Analyzing trace with hash 794520256, now seen corresponding path program 303 times [2018-12-03 16:56:58,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:58,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:58,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:58,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:58,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:58,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:58,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:58,088 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:56:58,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:58,089 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 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:58,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:58,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:58,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:58,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:58,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:58,106 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:58,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:58,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:58,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:58,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:58,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:58,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:58,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:58,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:58,311 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:56:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:58,726 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:56:58,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:56:58,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:56:58,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:58,727 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:56:58,727 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:56:58,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:56:58,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-12-03 16:56:58,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:56:58,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:56:58,940 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 11 [2018-12-03 16:56:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:58,940 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:56:58,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:56:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:56:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:56:58,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:58,940 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:56:58,940 INFO L423 AbstractCegarLoop]: === Iteration 320 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:58,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:58,941 INFO L82 PathProgramCache]: Analyzing trace with hash 449751042, now seen corresponding path program 304 times [2018-12-03 16:56:58,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:58,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:58,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:58,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:58,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:59,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:59,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:59,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:59,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 16:56:59,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:59,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 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:59,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:59,111 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:59,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:59,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:59,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:59,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:56:59,255 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:59,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:56:59,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:56:59,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:56:59,256 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 11 states. [2018-12-03 16:57:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:00,053 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:57:00,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:00,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:00,054 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:57:00,054 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:57:00,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:57:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:57:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:00,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:00,463 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:00,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:00,463 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:00,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:00,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:00,464 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:57:00,464 INFO L423 AbstractCegarLoop]: === Iteration 321 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:00,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:00,464 INFO L82 PathProgramCache]: Analyzing trace with hash 449752964, now seen corresponding path program 305 times [2018-12-03 16:57:00,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:00,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:00,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:00,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:00,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:00,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:00,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:00,533 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:00,533 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:57:00,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:00,533 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 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:00,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:00,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:00,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:00,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:00,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:00,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:00,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:00,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:00,686 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:00,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:00,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:00,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:00,687 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:01,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:01,494 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:57:01,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:01,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:01,495 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:57:01,495 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:57:01,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:01,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:57:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:57:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:01,868 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:01,868 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:01,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:01,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:01,868 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:57:01,868 INFO L423 AbstractCegarLoop]: === Iteration 322 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:01,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 449810624, now seen corresponding path program 306 times [2018-12-03 16:57:01,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:01,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:01,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:01,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:01,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:01,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:01,935 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:57:01,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:01,935 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 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:01,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:01,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:01,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:01,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:01,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:01,955 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:01,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:02,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:02,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:02,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:02,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:02,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:02,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:02,097 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:02,865 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:57:02,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:02,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:02,865 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:57:02,866 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:57:02,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:57:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:57:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:03,247 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:03,247 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:03,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:03,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:03,247 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:03,248 INFO L423 AbstractCegarLoop]: === Iteration 323 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:03,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash 449812546, now seen corresponding path program 307 times [2018-12-03 16:57:03,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:03,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:03,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:03,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:03,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:03,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:03,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:03,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:03,316 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:57:03,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:03,316 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 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:03,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:03,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:03,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:03,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:03,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:03,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:03,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:03,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:03,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:03,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:03,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:03,754 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:04,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:04,512 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:57:04,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:04,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:04,512 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:57:04,513 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:57:04,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:57:04,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2018-12-03 16:57:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:57:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:57:04,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:57:04,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:04,875 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:57:04,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:57:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:04,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:04,875 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:57:04,875 INFO L423 AbstractCegarLoop]: === Iteration 324 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:04,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:04,875 INFO L82 PathProgramCache]: Analyzing trace with hash 451598084, now seen corresponding path program 308 times [2018-12-03 16:57:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:04,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:04,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:04,944 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:04,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:04,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:04,945 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:04,945 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:57:04,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:04,945 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 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:04,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:04,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:04,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:04,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:04,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:04,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:05,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:05,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:05,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:05,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:05,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:05,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:05,101 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:57:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:05,911 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:57:05,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:05,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:05,912 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:57:05,912 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:57:05,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:05,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:57:06,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:57:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:06,298 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:06,298 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:06,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:06,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:06,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:06,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:06,298 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:06,298 INFO L423 AbstractCegarLoop]: === Iteration 325 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:06,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 451600006, now seen corresponding path program 309 times [2018-12-03 16:57:06,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:06,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:06,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:06,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:06,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:06,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:06,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:06,369 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:57:06,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:06,369 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 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:06,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:06,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:06,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:06,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:06,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:06,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:06,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:06,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:06,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:06,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:06,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:06,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:06,521 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:07,352 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:57:07,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:07,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:07,353 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:57:07,353 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:57:07,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:57:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:57:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:07,745 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:07,745 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:07,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:07,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:07,745 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:07,745 INFO L423 AbstractCegarLoop]: === Iteration 326 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:07,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash 451657666, now seen corresponding path program 310 times [2018-12-03 16:57:07,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:07,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:07,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:07,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:07,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:07,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:07,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:07,816 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:07,816 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:57:07,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:07,816 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 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:07,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:07,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:07,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:07,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:07,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:07,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:07,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:07,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:07,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:07,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:07,969 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:08,729 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:57:08,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:08,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:08,730 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:57:08,730 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:57:08,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:57:09,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:57:09,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:09,139 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:09,139 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:09,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:09,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:09,139 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:09,139 INFO L423 AbstractCegarLoop]: === Iteration 327 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:09,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:09,139 INFO L82 PathProgramCache]: Analyzing trace with hash 451659588, now seen corresponding path program 311 times [2018-12-03 16:57:09,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:09,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:09,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:09,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:09,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:09,208 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:09,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:09,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:09,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:09,209 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:57:09,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:09,209 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 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:09,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:09,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:09,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:09,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:09,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:09,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:09,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:09,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:09,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:09,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:09,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:09,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:09,363 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:10,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:10,100 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:57:10,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:10,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:10,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:10,101 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:57:10,101 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:57:10,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:57:10,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-12-03 16:57:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:57:10,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:57:10,446 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:57:10,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:10,446 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:57:10,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:57:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:10,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:10,446 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:57:10,446 INFO L423 AbstractCegarLoop]: === Iteration 328 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:10,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:10,446 INFO L82 PathProgramCache]: Analyzing trace with hash 507009344, now seen corresponding path program 312 times [2018-12-03 16:57:10,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:10,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:10,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:10,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:10,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:10,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:10,514 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:10,514 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:57:10,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:10,514 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 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:10,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:10,523 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:10,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:10,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:10,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:10,531 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:10,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:10,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:10,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:10,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:10,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:10,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:10,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:10,660 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:57:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:11,384 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:57:11,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:11,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:11,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:11,385 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:57:11,385 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:57:11,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:57:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:57:11,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:11,797 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:11,798 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:11,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:11,798 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:11,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:11,798 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:11,798 INFO L423 AbstractCegarLoop]: === Iteration 329 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:11,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:11,798 INFO L82 PathProgramCache]: Analyzing trace with hash 507011266, now seen corresponding path program 313 times [2018-12-03 16:57:11,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:11,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:11,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:11,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:11,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:11,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:11,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:11,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:11,864 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:57:11,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:11,865 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 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:11,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:11,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:11,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:11,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:12,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:12,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:12,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:12,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:12,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:12,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:12,023 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:12,754 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:57:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:12,754 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:12,755 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:57:12,755 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:57:12,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:57:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:57:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:13,171 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:13,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:13,171 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:13,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:13,171 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:13,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:13,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:13,172 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:13,172 INFO L423 AbstractCegarLoop]: === Iteration 330 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:13,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:13,172 INFO L82 PathProgramCache]: Analyzing trace with hash 507068926, now seen corresponding path program 314 times [2018-12-03 16:57:13,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:13,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:13,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:13,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:13,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:13,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:13,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:13,241 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:13,241 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:57:13,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:13,241 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 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:13,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:13,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:13,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:13,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:13,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:13,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:13,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:13,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:13,388 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:13,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:13,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:13,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:13,389 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:14,113 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:57:14,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:14,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:14,114 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:57:14,114 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:57:14,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:14,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:57:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:57:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:14,512 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:14,512 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:14,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:14,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:14,512 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:14,512 INFO L423 AbstractCegarLoop]: === Iteration 331 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:14,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash 507070848, now seen corresponding path program 315 times [2018-12-03 16:57:14,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:14,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:14,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:14,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:14,578 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:14,578 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:57:14,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:14,578 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 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:14,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:14,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:14,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:14,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:14,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:14,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:14,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:14,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:14,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:14,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:14,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:14,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:14,739 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:15,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:15,467 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:57:15,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:15,467 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:15,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:15,468 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:57:15,468 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:57:15,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:15,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:57:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-12-03 16:57:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:57:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:57:15,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:57:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:15,843 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:57:15,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:57:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:15,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:15,844 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:15,844 INFO L423 AbstractCegarLoop]: === Iteration 332 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:15,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash 508856386, now seen corresponding path program 316 times [2018-12-03 16:57:15,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:15,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:15,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:15,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:15,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:15,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:15,934 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:57:15,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:15,934 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 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:15,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:15,943 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:15,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:15,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:16,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:16,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:16,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:16,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:16,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:16,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:16,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:16,090 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:57:16,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:16,780 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:57:16,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:16,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:16,780 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:57:16,781 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:57:16,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:16,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:57:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 16:57:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:17,177 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:17,177 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:17,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:17,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:17,178 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:17,178 INFO L423 AbstractCegarLoop]: === Iteration 333 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:17,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 508858308, now seen corresponding path program 317 times [2018-12-03 16:57:17,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:17,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:17,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:17,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:17,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:17,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:17,294 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:17,294 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:57:17,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:17,294 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 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:17,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:17,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:17,312 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:17,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:17,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:17,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:17,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:17,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:17,439 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:17,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:17,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:17,440 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:18,141 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:57:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:18,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:18,142 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:57:18,142 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:57:18,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:18,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:57:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:57:18,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:18,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:18,527 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:18,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:18,528 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:18,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:18,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:18,528 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:18,528 INFO L423 AbstractCegarLoop]: === Iteration 334 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:18,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash 508915968, now seen corresponding path program 318 times [2018-12-03 16:57:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:18,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:18,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:18,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:18,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:18,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:18,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:18,598 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:57:18,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:18,599 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 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:18,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:18,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:18,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:18,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:18,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:18,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:18,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:18,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:18,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:18,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:18,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:18,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:18,812 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:19,478 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:57:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:19,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:19,479 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:57:19,479 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:57:19,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:19,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:57:19,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:57:19,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:19,884 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:19,884 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:19,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:19,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:19,885 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:19,885 INFO L423 AbstractCegarLoop]: === Iteration 335 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:19,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash 508917890, now seen corresponding path program 319 times [2018-12-03 16:57:19,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:19,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:19,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:19,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:19,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:19,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:19,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:19,953 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:19,953 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:57:19,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:19,953 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 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:19,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:19,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:19,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:19,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:20,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:20,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:20,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:20,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:20,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:20,104 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:20,738 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:57:20,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:20,738 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:20,739 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:57:20,739 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:57:20,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:20,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:57:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 15. [2018-12-03 16:57:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:57:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:57:21,035 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 16:57:21,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:21,035 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:57:21,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:21,035 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:57:21,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:21,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:21,036 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:57:21,036 INFO L423 AbstractCegarLoop]: === Iteration 336 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:21,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:21,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2070208892, now seen corresponding path program 320 times [2018-12-03 16:57:21,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:21,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:21,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:21,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:21,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:21,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:21,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:21,112 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:21,112 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:57:21,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:21,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:21,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:21,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:21,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:21,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:21,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:21,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:21,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:21,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:21,264 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:21,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:21,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:21,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:21,265 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 16:57:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:22,110 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:57:22,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:22,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:22,111 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:57:22,111 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:57:22,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:22,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:57:22,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:57:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:22,522 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:22,522 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:22,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:22,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:22,522 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:22,522 INFO L423 AbstractCegarLoop]: === Iteration 337 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:22,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2070206970, now seen corresponding path program 321 times [2018-12-03 16:57:22,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:22,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:22,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:22,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:22,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:22,587 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:22,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:22,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:22,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 16:57:22,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:22,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 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:22,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:22,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:22,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:22,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:22,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:22,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:22,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:22,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:22,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:22,758 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:23,601 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:57:23,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:23,601 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:23,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:23,602 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:57:23,602 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:57:23,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:57:23,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:57:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:23,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:23,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:23,996 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:23,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:23,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:23,996 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:23,996 INFO L423 AbstractCegarLoop]: === Iteration 338 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:23,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:23,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2070149310, now seen corresponding path program 322 times [2018-12-03 16:57:23,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:23,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:24,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:24,099 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:24,099 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:57:24,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,099 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 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:24,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:24,106 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:24,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:24,113 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:24,295 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:24,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:24,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:24,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:24,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:24,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:24,314 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:25,113 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:57:25,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:25,113 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:25,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:25,114 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:57:25,114 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:57:25,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:25,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:57:25,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:57:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:25,535 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:25,535 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:25,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:25,536 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:25,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:25,536 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:25,536 INFO L423 AbstractCegarLoop]: === Iteration 339 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:25,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:25,536 INFO L82 PathProgramCache]: Analyzing trace with hash -2070147388, now seen corresponding path program 323 times [2018-12-03 16:57:25,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:25,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:25,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:25,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:25,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:25,602 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:57:25,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,602 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 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:25,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:25,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:25,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:25,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:25,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:25,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:25,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:25,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:25,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:25,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:25,752 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:26,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:26,527 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:57:26,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:26,527 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:26,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:26,528 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:57:26,528 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:57:26,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:57:26,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 17. [2018-12-03 16:57:26,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:57:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:57:26,896 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:57:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:26,896 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:57:26,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:57:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:26,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:26,897 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:26,897 INFO L423 AbstractCegarLoop]: === Iteration 340 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:26,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:26,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2068361850, now seen corresponding path program 324 times [2018-12-03 16:57:26,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:26,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:26,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:26,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:26,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:26,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:26,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:26,969 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:26,969 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:57:26,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:26,969 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 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:26,978 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:26,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:26,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:26,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:26,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:26,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:26,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:27,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:27,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:27,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:27,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:27,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:27,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:27,117 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:57:27,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:27,950 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:57:27,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:27,950 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:27,951 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:57:27,951 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:57:27,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:57:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 16:57:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:28,375 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:28,376 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:28,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:28,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:28,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:28,376 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:28,376 INFO L423 AbstractCegarLoop]: === Iteration 341 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:28,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2068359928, now seen corresponding path program 325 times [2018-12-03 16:57:28,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:28,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:28,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:28,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:28,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:28,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:28,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:28,447 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:57:28,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:28,447 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 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:28,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:28,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:28,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:28,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:28,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:28,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:28,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:28,611 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:28,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:28,612 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:29,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:29,453 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:57:29,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:29,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:29,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:29,454 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:57:29,454 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:57:29,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:57:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:57:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:29,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:29,861 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:29,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:29,861 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:29,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:29,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:29,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:29,861 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:29,861 INFO L423 AbstractCegarLoop]: === Iteration 342 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:29,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:29,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2068302268, now seen corresponding path program 326 times [2018-12-03 16:57:29,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:29,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:29,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:29,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:29,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:29,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:29,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:29,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:29,927 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:57:29,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:29,927 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 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:29,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:29,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:29,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:29,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:29,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:29,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:30,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:30,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:30,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:30,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:30,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:30,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:30,079 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:30,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:30,881 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:57:30,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:30,881 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:30,882 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:57:30,882 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:57:30,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:57:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:57:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:31,282 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:31,282 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:31,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:31,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:31,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:31,282 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:31,283 INFO L423 AbstractCegarLoop]: === Iteration 343 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:31,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:31,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2068300346, now seen corresponding path program 327 times [2018-12-03 16:57:31,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:31,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:31,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:31,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:31,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:31,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:31,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:31,367 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:31,367 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:57:31,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:31,367 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 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:31,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:31,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:31,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:31,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:31,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:31,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:31,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:31,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:31,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:31,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:31,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:31,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:31,531 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:32,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:32,311 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:57:32,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:32,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:32,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:32,312 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:57:32,312 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:57:32,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:57:32,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 16. [2018-12-03 16:57:32,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:57:32,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:57:32,659 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:57:32,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:32,659 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:57:32,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:32,659 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:57:32,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:32,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:32,659 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:32,660 INFO L423 AbstractCegarLoop]: === Iteration 344 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:32,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:32,660 INFO L82 PathProgramCache]: Analyzing trace with hash -2012950590, now seen corresponding path program 328 times [2018-12-03 16:57:32,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:32,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:32,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:32,726 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:32,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:32,727 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:32,727 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:32,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 16:57:32,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:32,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 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:32,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:32,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:32,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:32,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:32,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:32,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:32,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:32,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:32,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:32,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:32,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:32,866 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:57:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:33,636 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:57:33,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:33,636 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:33,637 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:57:33,637 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:57:33,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:57:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:57:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:34,042 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:34,042 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:34,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:34,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:34,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:34,043 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:34,043 INFO L423 AbstractCegarLoop]: === Iteration 345 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:34,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash -2012948668, now seen corresponding path program 329 times [2018-12-03 16:57:34,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:34,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:34,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:34,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:34,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:34,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:34,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:34,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:34,185 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:57:34,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:34,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 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:34,196 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:34,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:34,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:34,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:34,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:34,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:34,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:34,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:34,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:34,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:34,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:34,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:34,525 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:35,260 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:57:35,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:35,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:35,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:35,261 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:57:35,261 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:57:35,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:57:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 16:57:35,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:35,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:35,661 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:35,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:35,661 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:35,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:35,661 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:35,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:35,662 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:35,662 INFO L423 AbstractCegarLoop]: === Iteration 346 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:35,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2012891008, now seen corresponding path program 330 times [2018-12-03 16:57:35,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:35,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:35,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:35,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:35,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:35,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:35,752 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:57:35,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:35,753 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 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:35,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:35,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:35,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:35,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:35,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:35,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:35,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:35,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:35,892 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:35,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:35,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:35,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:35,893 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:36,668 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:57:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:36,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:36,669 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:57:36,669 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:57:36,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:57:37,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:57:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:37,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:37,126 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:37,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:37,126 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:37,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:37,126 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:37,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:37,126 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:37,126 INFO L423 AbstractCegarLoop]: === Iteration 347 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:37,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:37,126 INFO L82 PathProgramCache]: Analyzing trace with hash -2012889086, now seen corresponding path program 331 times [2018-12-03 16:57:37,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:37,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:37,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:37,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:37,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:37,207 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:57:37,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:37,207 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 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:37,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:37,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:37,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:37,223 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:37,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:37,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:37,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:37,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:37,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:37,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:37,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:37,356 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:38,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:38,095 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:57:38,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:38,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:38,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:38,096 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:57:38,096 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:57:38,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:57:38,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 17. [2018-12-03 16:57:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:57:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:57:38,470 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:57:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:38,470 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:57:38,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:38,470 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:57:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:38,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:38,470 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:38,470 INFO L423 AbstractCegarLoop]: === Iteration 348 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:38,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2011103548, now seen corresponding path program 332 times [2018-12-03 16:57:38,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:38,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:38,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:38,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:38,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:38,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:38,537 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:38,537 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:57:38,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:38,537 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 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:38,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:38,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:38,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:38,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:38,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:38,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:38,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:38,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:38,705 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:38,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:38,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:38,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:38,706 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:57:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:39,408 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:57:39,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:39,408 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:39,408 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:57:39,408 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:57:39,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:39,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:57:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 16:57:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:39,811 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:39,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:39,811 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:39,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:39,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:39,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:39,811 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:39,811 INFO L423 AbstractCegarLoop]: === Iteration 349 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:39,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:39,812 INFO L82 PathProgramCache]: Analyzing trace with hash -2011101626, now seen corresponding path program 333 times [2018-12-03 16:57:39,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:39,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:39,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:39,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:39,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:39,883 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:39,883 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:57:39,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:39,883 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 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:39,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:39,891 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:39,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:39,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:39,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:39,901 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:39,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:40,047 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:40,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:40,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:40,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:40,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:40,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:40,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:40,066 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:40,778 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:57:40,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:40,778 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:40,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:40,779 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:57:40,779 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:57:40,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:57:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:57:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:41,176 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:41,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:41,176 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:41,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:41,176 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:41,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:41,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:41,176 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:41,177 INFO L423 AbstractCegarLoop]: === Iteration 350 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:41,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:41,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2011043966, now seen corresponding path program 334 times [2018-12-03 16:57:41,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:41,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:41,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:41,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:41,247 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:41,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:41,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:41,248 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:41,248 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:57:41,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:41,248 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 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:41,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:41,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:41,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:41,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:41,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:41,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:41,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:41,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:41,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:41,427 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:42,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:42,096 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:57:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:42,096 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:42,096 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:57:42,096 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:57:42,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:57:42,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:57:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:42,493 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:42,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:42,494 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:42,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:42,494 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:42,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:42,494 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:57:42,494 INFO L423 AbstractCegarLoop]: === Iteration 351 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:42,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash -2011042044, now seen corresponding path program 335 times [2018-12-03 16:57:42,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:42,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:42,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:42,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:42,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:42,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:42,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:42,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:42,570 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:57:42,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:42,570 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 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:42,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:42,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:42,587 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:42,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:42,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:42,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:42,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:42,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:42,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:42,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:42,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:42,717 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:43,387 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:57:43,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:43,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:43,388 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:57:43,388 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:57:43,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:57:43,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 14. [2018-12-03 16:57:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:57:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 16:57:43,662 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 11 [2018-12-03 16:57:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:43,663 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 16:57:43,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:43,663 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 16:57:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:43,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:43,663 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:57:43,663 INFO L423 AbstractCegarLoop]: === Iteration 352 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:43,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash -359595584, now seen corresponding path program 336 times [2018-12-03 16:57:43,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:43,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:43,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:43,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:43,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:43,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:43,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:43,759 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:43,760 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:57:43,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:43,760 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 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:43,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:43,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:43,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:43,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:43,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:43,807 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:43,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:44,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:44,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:44,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:44,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:44,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:44,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:44,111 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 11 states. [2018-12-03 16:57:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:44,846 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:57:44,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:44,846 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:44,847 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:57:44,847 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:57:44,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:57:44,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:57:45,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:57:45,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:45,280 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:45,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:45,280 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:45,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:45,280 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:45,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:45,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:45,281 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:45,281 INFO L423 AbstractCegarLoop]: === Iteration 353 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:45,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:45,281 INFO L82 PathProgramCache]: Analyzing trace with hash -359593662, now seen corresponding path program 337 times [2018-12-03 16:57:45,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:45,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:45,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:45,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:45,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:45,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:45,347 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:45,347 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:57:45,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:45,347 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 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:45,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:45,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:45,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:45,363 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:45,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:45,468 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:45,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:45,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:45,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:45,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:45,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:45,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:45,487 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:46,228 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:57:46,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:46,228 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:46,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:46,229 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:57:46,229 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:57:46,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:46,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:57:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:57:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:46,648 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:46,648 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:46,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:46,649 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:46,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:46,649 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:46,649 INFO L423 AbstractCegarLoop]: === Iteration 354 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:46,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:46,649 INFO L82 PathProgramCache]: Analyzing trace with hash -359536002, now seen corresponding path program 338 times [2018-12-03 16:57:46,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:46,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:46,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:46,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:46,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:46,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:46,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:46,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:46,718 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:57:46,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:46,718 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 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:46,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:46,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:46,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:46,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:46,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:46,737 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:46,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:46,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:46,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:46,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:46,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:46,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:46,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:46,862 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:47,630 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:57:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:47,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:47,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:47,631 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:57:47,631 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:57:47,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:47,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:57:48,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:57:48,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:48,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:48,068 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:48,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:48,068 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:48,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:48,068 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:48,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:48,068 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:48,069 INFO L423 AbstractCegarLoop]: === Iteration 355 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:48,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:48,069 INFO L82 PathProgramCache]: Analyzing trace with hash -359534080, now seen corresponding path program 339 times [2018-12-03 16:57:48,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:48,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:48,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:48,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:48,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:48,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:48,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:48,148 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:48,148 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:57:48,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:48,148 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 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:48,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:48,157 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:48,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:48,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:48,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:48,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:48,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:48,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:48,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:48,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:48,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:48,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:48,303 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:49,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:49,051 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:57:49,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:49,051 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:49,052 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:57:49,052 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:57:49,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:57:49,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 16:57:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:57:49,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:57:49,452 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:57:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:49,452 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:57:49,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:57:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:49,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:49,452 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:49,453 INFO L423 AbstractCegarLoop]: === Iteration 356 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:49,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash -357748542, now seen corresponding path program 340 times [2018-12-03 16:57:49,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:49,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:49,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:49,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:49,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:49,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:49,540 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:49,540 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:57:49,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:49,540 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 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:49,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:49,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:49,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:49,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:49,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:49,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:49,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:49,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:49,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:49,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:49,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:49,833 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:57:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:50,522 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:57:50,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:50,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:50,523 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:57:50,523 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:57:50,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:57:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:57:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:57:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:50,945 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:50,945 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:50,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:50,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:50,946 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:50,946 INFO L423 AbstractCegarLoop]: === Iteration 357 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:50,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:50,946 INFO L82 PathProgramCache]: Analyzing trace with hash -357746620, now seen corresponding path program 341 times [2018-12-03 16:57:50,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:50,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:50,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:50,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:50,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:51,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:51,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:51,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:51,012 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:57:51,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:51,012 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 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:51,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:51,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:51,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:51,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:51,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:51,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:51,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:51,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:51,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:51,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:51,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:51,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:51,159 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:51,877 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:57:51,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:51,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:51,877 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:57:51,877 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:57:51,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:57:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 16:57:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:52,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:52,286 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:52,286 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:52,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:52,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:52,287 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:52,287 INFO L423 AbstractCegarLoop]: === Iteration 358 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:52,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash -357688960, now seen corresponding path program 342 times [2018-12-03 16:57:52,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:52,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:52,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:52,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:52,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:52,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:52,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:52,364 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:52,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:57:52,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:52,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 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:52,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:52,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:52,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:52,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:52,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:52,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:52,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:52,501 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:52,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:52,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:52,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:52,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:52,521 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:53,180 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:57:53,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:53,180 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:53,181 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:57:53,181 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:57:53,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:57:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 16:57:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:53,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:53,599 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:53,599 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:53,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:53,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:53,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:53,600 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:53,600 INFO L423 AbstractCegarLoop]: === Iteration 359 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:53,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash -357687038, now seen corresponding path program 343 times [2018-12-03 16:57:53,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:53,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:53,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:53,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:53,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:53,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:53,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:53,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:53,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:53,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:53,666 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:57:53,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:53,667 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 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:53,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:53,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:53,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:53,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:53,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:53,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:53,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:53,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:53,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:53,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:53,823 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:54,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:54,481 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:57:54,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:54,481 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:54,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:54,482 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:57:54,482 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:57:54,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:54,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:57:54,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2018-12-03 16:57:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:57:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:57:54,843 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:57:54,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:54,843 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:57:54,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:54,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:57:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:54,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:54,843 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:54,843 INFO L423 AbstractCegarLoop]: === Iteration 360 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:54,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash -302337282, now seen corresponding path program 344 times [2018-12-03 16:57:54,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:54,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:54,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:54,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:54,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:54,930 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:54,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:54,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:54,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:54,931 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:57:54,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:54,931 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 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:54,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:54,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:54,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:54,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:54,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:54,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:55,051 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:55,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:55,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:55,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:55,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:55,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:55,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:55,071 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:57:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:55,837 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:57:55,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:55,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:55,838 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:57:55,838 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:57:55,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:57:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:57:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:56,265 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:56,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:56,265 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:56,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:56,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:56,266 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:56,266 INFO L423 AbstractCegarLoop]: === Iteration 361 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:56,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:56,266 INFO L82 PathProgramCache]: Analyzing trace with hash -302335360, now seen corresponding path program 345 times [2018-12-03 16:57:56,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:56,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:56,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:56,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:56,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:56,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:56,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:56,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:56,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 16:57:56,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:56,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 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:56,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:56,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:56,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:56,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:56,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:56,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:56,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:56,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:56,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:56,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:56,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:56,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:56,525 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:57:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:57,278 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:57:57,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:57,278 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:57,279 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:57:57,279 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:57:57,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:57:57,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-12-03 16:57:57,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:57,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:57:57,700 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:57:57,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:57,700 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:57:57,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:57:57,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:57,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:57,700 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:57:57,701 INFO L423 AbstractCegarLoop]: === Iteration 362 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:57,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:57,701 INFO L82 PathProgramCache]: Analyzing trace with hash -302277700, now seen corresponding path program 346 times [2018-12-03 16:57:57,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:57,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:57,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:57,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:57,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:57,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:57,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:57,769 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:57:57,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:57,769 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 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:57,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:57,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:57,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:57,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:57,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:57,902 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:57,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:57,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:57,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:57,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:57,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:57,920 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:57:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:58,692 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:57:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:58,692 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:58,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:58,693 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:57:58,693 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:57:58,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:58,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:57:59,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 16:57:59,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:57:59,177 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:57:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:59,177 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:57:59,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:57:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:59,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:59,178 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:57:59,178 INFO L423 AbstractCegarLoop]: === Iteration 363 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:59,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash -302275778, now seen corresponding path program 347 times [2018-12-03 16:57:59,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:59,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:59,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:59,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:59,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:59,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:59,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:59,248 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:59,248 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:57:59,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:59,248 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 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:59,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:59,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:59,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:59,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:59,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:59,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:59,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:59,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:59,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:59,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:59,396 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:00,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:00,124 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:58:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:00,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:00,125 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:58:00,125 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:58:00,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:00,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:58:00,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 16:58:00,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:58:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:58:00,534 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:58:00,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:00,534 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:58:00,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:58:00,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:00,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:00,535 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:58:00,535 INFO L423 AbstractCegarLoop]: === Iteration 364 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:00,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash -300490240, now seen corresponding path program 348 times [2018-12-03 16:58:00,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:00,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:00,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:00,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:00,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:00,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:00,607 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:00,607 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:00,607 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:58:00,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:00,607 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 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:00,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:00,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:00,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:00,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:00,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:00,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:00,789 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:00,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:00,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:00,808 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:00,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:00,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:00,808 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:58:01,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:01,529 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:58:01,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:01,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:01,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:01,530 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:58:01,530 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:58:01,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:58:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 16:58:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:01,960 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:01,961 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:01,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:01,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:01,961 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:01,961 INFO L423 AbstractCegarLoop]: === Iteration 365 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:01,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:01,961 INFO L82 PathProgramCache]: Analyzing trace with hash -300488318, now seen corresponding path program 349 times [2018-12-03 16:58:01,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:01,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:01,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:01,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:01,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:02,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:02,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:02,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:02,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:02,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:02,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:02,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 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:02,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:02,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:02,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:02,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:02,155 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:02,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:02,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:02,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:02,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:02,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:02,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:02,175 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:02,889 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 16:58:02,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:02,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:02,890 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:58:02,890 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:58:02,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:58:03,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-12-03 16:58:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:58:03,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:58:03,309 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:58:03,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:03,309 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:58:03,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:03,309 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:58:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:03,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:03,309 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:03,309 INFO L423 AbstractCegarLoop]: === Iteration 366 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:03,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash -300430658, now seen corresponding path program 350 times [2018-12-03 16:58:03,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:03,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:03,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:03,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:03,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:03,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:03,378 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:03,378 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:58:03,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:03,379 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 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:03,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:03,391 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:03,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:03,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:03,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:03,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:03,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:03,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:03,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:03,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:03,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:03,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:03,526 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:58:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:04,207 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:58:04,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:04,207 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:04,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:04,207 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:58:04,207 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:58:04,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:58:04,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 16:58:04,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:04,632 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:04,632 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:04,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:04,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:04,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:04,633 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:04,633 INFO L423 AbstractCegarLoop]: === Iteration 367 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:04,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:04,633 INFO L82 PathProgramCache]: Analyzing trace with hash -300428736, now seen corresponding path program 351 times [2018-12-03 16:58:04,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:04,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:04,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:04,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:04,701 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:04,701 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:04,701 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:58:04,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:04,701 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 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:04,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:04,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:04,714 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:04,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:04,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:04,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:04,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:05,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:05,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:05,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:05,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:05,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:05,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:05,060 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:05,712 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:58:05,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:05,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:05,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:05,713 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:58:05,713 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:58:05,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:58:05,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:58:06,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 15. [2018-12-03 16:58:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:58:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:58:06,036 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 16:58:06,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:06,036 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:58:06,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:58:06,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:06,036 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:06,036 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:06,037 INFO L423 AbstractCegarLoop]: === Iteration 368 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:06,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:06,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1415411778, now seen corresponding path program 352 times [2018-12-03 16:58:06,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:06,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:06,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:06,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:06,038 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:06,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:06,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:06,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:06,109 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:58:06,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:06,109 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 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:06,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:06,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:06,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:06,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:06,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:06,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:06,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:06,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:06,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:06,250 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 16:58:06,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:06,914 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:58:06,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:06,914 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:06,915 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:58:06,915 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:58:06,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:58:07,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 16:58:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:07,357 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:07,357 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:07,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:07,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:07,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:07,357 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:58:07,357 INFO L423 AbstractCegarLoop]: === Iteration 369 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:07,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:07,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1415413700, now seen corresponding path program 353 times [2018-12-03 16:58:07,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:07,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:07,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:07,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:07,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:07,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:07,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:07,424 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:58:07,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:07,424 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 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:07,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:07,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:07,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:07,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:07,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:07,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:07,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:07,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:07,587 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:07,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:07,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:07,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:07,587 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:08,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:08,255 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:58:08,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:08,255 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:08,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:08,256 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:58:08,256 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:58:08,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:08,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:58:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 16:58:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:58:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:58:08,686 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:58:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:08,686 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:58:08,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:58:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:08,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:08,686 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:58:08,686 INFO L423 AbstractCegarLoop]: === Iteration 370 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:08,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1415471360, now seen corresponding path program 354 times [2018-12-03 16:58:08,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:08,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:08,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:08,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:08,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:08,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:08,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:08,754 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:08,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 16:58:08,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:08,754 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 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:08,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:08,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:08,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:08,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:08,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:08,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:08,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:08,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:08,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:08,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:08,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:08,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:08,914 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:58:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:09,552 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:58:09,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:09,552 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:09,553 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:58:09,553 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:58:09,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:58:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-12-03 16:58:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:09,992 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:09,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:09,993 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:09,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:09,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:09,993 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:09,993 INFO L423 AbstractCegarLoop]: === Iteration 371 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:09,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:09,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1415473282, now seen corresponding path program 355 times [2018-12-03 16:58:09,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:09,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:09,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:09,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:10,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:10,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:10,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:10,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:10,163 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:58:10,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:10,163 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 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:10,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:10,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:10,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:10,181 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:10,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:10,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:10,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:10,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:10,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:10,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:10,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:10,361 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:10,994 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:58:10,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:10,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:10,995 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:58:10,995 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:58:10,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:58:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:58:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2018-12-03 16:58:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:58:11,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:58:11,400 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:58:11,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:11,400 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:58:11,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:11,400 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:58:11,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:11,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:11,400 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:58:11,400 INFO L423 AbstractCegarLoop]: === Iteration 372 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:11,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:11,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1417258820, now seen corresponding path program 356 times [2018-12-03 16:58:11,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:11,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:11,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:11,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:11,475 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:11,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:11,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:11,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:11,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 16:58:11,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:11,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 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:11,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:11,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:11,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:11,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:11,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:11,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:11,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:11,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:11,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:11,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:11,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:11,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:11,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:11,650 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:58:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:12,320 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:58:12,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:12,320 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:12,321 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:58:12,321 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:58:12,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:12,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:58:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2018-12-03 16:58:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:12,764 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:12,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:12,765 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:12,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:12,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:12,765 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:12,765 INFO L423 AbstractCegarLoop]: === Iteration 373 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:12,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:12,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1417260742, now seen corresponding path program 357 times [2018-12-03 16:58:12,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:12,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:12,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:12,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:12,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:12,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:12,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:12,835 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:58:12,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:12,835 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 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:12,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:12,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:12,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:12,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:12,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:12,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:12,960 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:12,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:12,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:12,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:12,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:12,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:12,980 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:13,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:13,683 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 16:58:13,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:13,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:13,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:13,684 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:58:13,684 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:58:13,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:58:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2018-12-03 16:58:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:58:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:58:14,104 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:58:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:14,104 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:58:14,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:58:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:14,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:14,104 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:14,104 INFO L423 AbstractCegarLoop]: === Iteration 374 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:14,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:14,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1417318402, now seen corresponding path program 358 times [2018-12-03 16:58:14,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:14,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:14,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:14,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:14,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:14,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:14,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:14,175 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:58:14,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:14,175 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 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:14,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:14,185 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:14,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:14,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:14,301 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:14,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:14,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:14,320 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:14,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:14,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:14,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:14,320 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:58:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:14,986 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 16:58:14,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:14,986 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:14,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:14,987 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:58:14,987 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:58:14,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:58:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2018-12-03 16:58:15,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:15,427 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:15,427 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:15,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:15,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:15,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:15,427 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:15,428 INFO L423 AbstractCegarLoop]: === Iteration 375 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:15,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1417320324, now seen corresponding path program 359 times [2018-12-03 16:58:15,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:15,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:15,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:15,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:15,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:15,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:15,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:15,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:15,505 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:58:15,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:15,505 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 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:15,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:15,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:15,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:15,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:15,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:15,524 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:15,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:15,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:15,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:15,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:15,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:15,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:15,649 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:16,258 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:58:16,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:16,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:16,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:16,259 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:58:16,259 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:58:16,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:58:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-12-03 16:58:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:58:16,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:58:16,620 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:58:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:16,620 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:58:16,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:58:16,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:16,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:16,620 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:58:16,620 INFO L423 AbstractCegarLoop]: === Iteration 376 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:16,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:16,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1472670080, now seen corresponding path program 360 times [2018-12-03 16:58:16,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:16,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:16,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:16,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:16,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:16,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:16,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:16,687 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:58:16,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:16,687 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 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:16,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:16,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:16,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:16,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:16,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:16,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:16,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:16,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:16,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:16,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:16,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:16,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:16,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:16,870 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:58:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:17,478 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:58:17,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:17,478 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:17,479 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:58:17,479 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:58:17,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:17,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:58:17,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 16:58:17,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:17,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:17,927 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:17,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:17,927 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:17,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:17,927 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:17,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:17,927 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:17,928 INFO L423 AbstractCegarLoop]: === Iteration 377 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:17,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1472672002, now seen corresponding path program 361 times [2018-12-03 16:58:17,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:17,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:17,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:17,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:17,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:17,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:17,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:17,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:17,997 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:58:17,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:17,997 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 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:18,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:18,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:18,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:18,013 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:18,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:18,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:18,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:18,180 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:18,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:18,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:18,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:18,180 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:18,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:18,770 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:58:18,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:18,770 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:18,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:18,771 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:58:18,771 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:58:18,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:18,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:58:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 16:58:19,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:58:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:58:19,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:58:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:19,199 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:58:19,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:58:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:19,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:19,199 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:19,199 INFO L423 AbstractCegarLoop]: === Iteration 378 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:19,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:19,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1472729662, now seen corresponding path program 362 times [2018-12-03 16:58:19,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:19,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:19,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:19,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:19,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:19,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:19,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:19,267 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:19,267 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:58:19,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:19,267 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 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:19,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:19,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:19,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:19,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:19,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:19,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:19,390 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:19,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:19,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:19,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:19,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:19,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:19,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:19,409 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:58:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:20,124 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 16:58:20,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:20,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:20,125 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:58:20,125 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:58:20,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:58:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 16:58:20,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:20,589 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:20,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:20,590 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:20,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:20,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:20,590 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:20,590 INFO L423 AbstractCegarLoop]: === Iteration 379 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:20,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:20,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1472731584, now seen corresponding path program 363 times [2018-12-03 16:58:20,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:20,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:20,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:20,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:20,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:20,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:20,656 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:20,656 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:58:20,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:20,657 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 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:20,666 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:20,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:20,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:20,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:20,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:20,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:20,785 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:20,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:20,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:20,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:20,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:20,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:20,806 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:21,387 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 16:58:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:21,387 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:21,388 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:58:21,388 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:58:21,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:21,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:58:21,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2018-12-03 16:58:21,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:58:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:58:21,808 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:58:21,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:21,808 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:58:21,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:21,808 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:58:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:21,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:21,808 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:21,808 INFO L423 AbstractCegarLoop]: === Iteration 380 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:21,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:21,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1474517122, now seen corresponding path program 364 times [2018-12-03 16:58:21,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:21,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:21,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:21,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:21,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:21,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:21,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:21,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:21,874 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:58:21,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:21,874 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 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:21,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:21,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:21,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:21,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:22,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:22,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:22,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:22,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:22,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:22,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:22,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:22,038 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:58:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:22,600 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:58:22,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:22,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:22,601 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:58:22,601 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:58:22,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:58:23,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-12-03 16:58:23,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:23,067 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:23,067 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:23,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:23,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:23,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:23,067 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:23,067 INFO L423 AbstractCegarLoop]: === Iteration 381 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:23,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:23,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1474519044, now seen corresponding path program 365 times [2018-12-03 16:58:23,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:23,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:23,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:23,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:23,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:23,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:23,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:23,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:23,153 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:58:23,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:23,153 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 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:23,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:23,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:23,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:23,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:23,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:23,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:23,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:23,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:23,302 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:23,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:23,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:23,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:23,302 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:23,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:23,875 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 16:58:23,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:23,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:23,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:23,876 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:58:23,876 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:58:23,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:58:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2018-12-03 16:58:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:58:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:58:24,305 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:58:24,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:24,305 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:58:24,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:24,305 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:58:24,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:24,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:24,306 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:24,306 INFO L423 AbstractCegarLoop]: === Iteration 382 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:24,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:24,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1474576704, now seen corresponding path program 366 times [2018-12-03 16:58:24,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:24,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:24,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:24,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:24,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:24,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:24,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:24,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:24,403 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:58:24,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:24,403 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 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 382 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:24,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:24,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:24,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:24,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:24,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:24,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:24,517 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:24,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:24,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:24,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:24,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:24,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:24,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:24,537 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:58:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:25,079 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 16:58:25,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:25,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:25,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:25,079 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:58:25,079 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:58:25,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:58:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-12-03 16:58:25,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:25,554 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:25,554 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:25,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:25,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:25,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:25,554 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:58:25,555 INFO L423 AbstractCegarLoop]: === Iteration 383 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:25,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:25,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1474578626, now seen corresponding path program 367 times [2018-12-03 16:58:25,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:25,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:25,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:25,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:25,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:25,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:25,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:25,613 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:25,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 16:58:25,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:25,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 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 383 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:25,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:25,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:25,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:25,630 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:25,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:25,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:25,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:25,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:25,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:25,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:25,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:25,792 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:26,313 INFO L93 Difference]: Finished difference Result 22 states and 39 transitions. [2018-12-03 16:58:26,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:26,314 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:26,315 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:58:26,315 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:58:26,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:58:26,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2018-12-03 16:58:26,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:58:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 16:58:26,583 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 11 [2018-12-03 16:58:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:26,583 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 16:58:26,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:26,583 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 16:58:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:26,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:26,584 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 16:58:26,584 INFO L423 AbstractCegarLoop]: === Iteration 384 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:26,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash -623334338, now seen corresponding path program 368 times [2018-12-03 16:58:26,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:26,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:26,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:26,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:26,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:26,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:26,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:26,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:26,666 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:58:26,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:26,666 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 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 384 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:26,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:26,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:26,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:26,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:26,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:26,722 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:27,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:27,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:27,504 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:27,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:27,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:27,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:27,505 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 11 states. [2018-12-03 16:58:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:28,671 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:58:28,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:28,673 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:28,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:28,673 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:58:28,673 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:58:28,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:58:29,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:58:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:58:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:58:29,187 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:58:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:29,187 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:58:29,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:58:29,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:29,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:29,187 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:29,188 INFO L423 AbstractCegarLoop]: === Iteration 385 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:29,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:29,188 INFO L82 PathProgramCache]: Analyzing trace with hash -623332416, now seen corresponding path program 369 times [2018-12-03 16:58:29,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:29,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:29,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:29,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:29,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:29,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:29,278 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:58:29,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:29,278 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 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 385 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:29,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:29,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:29,292 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:29,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:29,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:29,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:29,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:29,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:29,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:29,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:29,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:29,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:29,424 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:58:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:30,577 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:58:30,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:30,577 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:30,578 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:58:30,578 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:58:30,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:30,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:58:31,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-03 16:58:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:31,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:31,083 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:31,083 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:31,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:31,083 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:31,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:31,083 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:31,084 INFO L423 AbstractCegarLoop]: === Iteration 386 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:31,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash -623274756, now seen corresponding path program 370 times [2018-12-03 16:58:31,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:31,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:31,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:31,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:31,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:31,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:31,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:31,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:31,156 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:58:31,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:31,156 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 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 386 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:31,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:31,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:31,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:31,172 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:31,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:31,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:31,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:31,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:31,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:31,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:31,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:31,308 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:32,519 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:58:32,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:32,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:32,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:32,520 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:58:32,520 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:58:32,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:32,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:58:33,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:58:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:58:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:58:33,032 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:58:33,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:33,033 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:58:33,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:58:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:33,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:33,033 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:33,033 INFO L423 AbstractCegarLoop]: === Iteration 387 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:33,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:33,033 INFO L82 PathProgramCache]: Analyzing trace with hash -623272834, now seen corresponding path program 371 times [2018-12-03 16:58:33,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:33,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:33,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:33,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:33,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:33,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:33,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:33,119 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:58:33,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:33,119 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 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 387 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:33,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:33,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:33,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:33,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:33,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:33,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:33,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:33,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:33,274 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:33,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:33,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:33,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:33,275 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:58:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:34,443 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:58:34,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:34,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:34,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:34,443 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:58:34,444 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:58:34,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:58:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-12-03 16:58:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:58:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:58:34,948 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:58:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:34,948 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:58:34,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:58:34,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:34,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:34,949 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:34,949 INFO L423 AbstractCegarLoop]: === Iteration 388 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:34,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:34,949 INFO L82 PathProgramCache]: Analyzing trace with hash -621487296, now seen corresponding path program 372 times [2018-12-03 16:58:34,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:34,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:34,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:34,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:34,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:35,016 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:35,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:35,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:35,017 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:35,017 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:58:35,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:35,018 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 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 388 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:35,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:35,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:35,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:35,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:35,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:35,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:35,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:35,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:35,187 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:35,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:35,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:35,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:35,188 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:58:36,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:36,286 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:58:36,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:36,286 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:36,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:36,287 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:58:36,287 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:58:36,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:36,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:58:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 16:58:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:58:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:58:36,810 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:58:36,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:36,810 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:58:36,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:58:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:36,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:36,810 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:36,810 INFO L423 AbstractCegarLoop]: === Iteration 389 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:36,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:36,811 INFO L82 PathProgramCache]: Analyzing trace with hash -621485374, now seen corresponding path program 373 times [2018-12-03 16:58:36,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:36,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:36,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:36,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:36,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:36,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:36,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:36,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:36,879 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:58:36,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:36,879 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 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 389 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:36,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:36,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:36,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:36,895 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:36,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:37,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:37,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:37,036 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:37,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:37,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:37,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:37,037 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:58:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:38,167 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:58:38,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:38,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:38,168 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:58:38,168 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:58:38,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:38,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:58:38,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2018-12-03 16:58:38,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:38,683 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:38,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:38,684 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:38,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:38,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:38,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:38,684 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:38,684 INFO L423 AbstractCegarLoop]: === Iteration 390 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:38,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:38,684 INFO L82 PathProgramCache]: Analyzing trace with hash -621427714, now seen corresponding path program 374 times [2018-12-03 16:58:38,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:38,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:38,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:38,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:38,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:38,753 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:38,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:38,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:38,754 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:38,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 16:58:38,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:38,754 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 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 390 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:38,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:38,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:38,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:38,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:38,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:38,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:38,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:38,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:38,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:38,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:38,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:38,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:38,908 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:40,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:40,038 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:58:40,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:40,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:40,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:40,039 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:58:40,039 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:58:40,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:40,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:58:40,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:58:40,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:58:40,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:58:40,562 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:58:40,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:40,562 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:58:40,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:58:40,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:40,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:40,563 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:58:40,563 INFO L423 AbstractCegarLoop]: === Iteration 391 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:40,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash -621425792, now seen corresponding path program 375 times [2018-12-03 16:58:40,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:40,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:40,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:40,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:40,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:40,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:40,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:40,743 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:40,744 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:58:40,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:40,744 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 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 391 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:40,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:40,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:40,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:40,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:40,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:40,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:40,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:40,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:40,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:40,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:40,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:40,937 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:58:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:41,984 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:58:41,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:41,984 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:41,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:41,984 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:58:41,984 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:58:41,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:58:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:58:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 17. [2018-12-03 16:58:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:58:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:58:42,438 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:58:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:42,438 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:58:42,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:42,439 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:58:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:42,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:42,439 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:42,439 INFO L423 AbstractCegarLoop]: === Iteration 392 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:42,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:42,439 INFO L82 PathProgramCache]: Analyzing trace with hash -566076036, now seen corresponding path program 376 times [2018-12-03 16:58:42,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:42,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:42,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:42,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:42,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:42,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:42,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:42,510 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:58:42,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:42,510 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 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 392 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:42,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:42,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:42,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:42,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:42,641 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:42,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:42,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:42,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:42,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:42,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:42,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:42,660 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:58:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:43,877 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:58:43,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:43,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:43,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:43,878 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:58:43,878 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:58:43,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:58:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:58:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:58:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:58:44,401 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:58:44,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:44,402 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:58:44,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:44,402 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:58:44,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:44,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:44,402 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:44,402 INFO L423 AbstractCegarLoop]: === Iteration 393 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:44,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:44,402 INFO L82 PathProgramCache]: Analyzing trace with hash -566074114, now seen corresponding path program 377 times [2018-12-03 16:58:44,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:44,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:44,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:44,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:44,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:44,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:44,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:44,472 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:44,472 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:58:44,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:44,473 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 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 393 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:44,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:44,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:44,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:44,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:44,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:44,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:44,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:44,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:44,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:44,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:44,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:44,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:44,627 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:58:45,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:45,786 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:58:45,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:45,786 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:45,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:45,787 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:58:45,787 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:58:45,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:45,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:58:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-03 16:58:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:46,300 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:46,300 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:46,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:46,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:46,301 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:46,301 INFO L423 AbstractCegarLoop]: === Iteration 394 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:46,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:46,301 INFO L82 PathProgramCache]: Analyzing trace with hash -566016454, now seen corresponding path program 378 times [2018-12-03 16:58:46,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:46,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:46,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:46,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:46,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:46,373 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:46,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:46,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:46,373 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:46,373 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:58:46,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:46,373 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 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 394 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:46,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:46,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:46,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:46,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:46,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:46,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:46,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:46,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:46,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:46,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:46,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:46,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:46,537 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:47,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:47,743 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:58:47,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:47,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:47,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:47,744 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:58:47,744 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:58:47,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:47,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:58:48,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:58:48,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:58:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:58:48,266 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:58:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:48,266 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:58:48,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:48,266 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:58:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:48,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:48,266 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:58:48,266 INFO L423 AbstractCegarLoop]: === Iteration 395 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:48,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:48,267 INFO L82 PathProgramCache]: Analyzing trace with hash -566014532, now seen corresponding path program 379 times [2018-12-03 16:58:48,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:48,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:48,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:48,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:48,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:48,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:48,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:48,334 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:58:48,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:48,334 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 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 395 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:48,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:48,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:48,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:48,349 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:48,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:48,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:48,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:48,495 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:48,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:48,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:48,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:48,496 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:58:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:49,670 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:58:49,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:49,670 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:49,671 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:58:49,671 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:58:49,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:49,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:58:50,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-12-03 16:58:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:58:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:58:50,152 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:58:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:50,152 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:58:50,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:58:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:50,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:50,152 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:50,152 INFO L423 AbstractCegarLoop]: === Iteration 396 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:50,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:50,153 INFO L82 PathProgramCache]: Analyzing trace with hash -564228994, now seen corresponding path program 380 times [2018-12-03 16:58:50,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:50,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:50,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:50,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:50,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:50,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:50,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:50,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:50,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 16:58:50,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:50,221 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 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 396 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:50,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:50,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:50,240 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:50,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:50,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:50,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:50,359 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:50,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:50,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:50,379 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:50,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:50,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:50,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:50,379 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:58:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:51,531 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:58:51,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:51,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:51,531 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:58:51,532 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:58:51,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:58:52,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 16:58:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:58:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:58:52,061 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:58:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:52,062 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:58:52,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:58:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:52,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:52,062 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:58:52,062 INFO L423 AbstractCegarLoop]: === Iteration 397 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:52,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:52,062 INFO L82 PathProgramCache]: Analyzing trace with hash -564227072, now seen corresponding path program 381 times [2018-12-03 16:58:52,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:52,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:52,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:52,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:52,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:52,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:52,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:52,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:52,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:52,129 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:58:52,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:52,129 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 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 397 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:52,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:52,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:52,145 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:52,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:52,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:52,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:52,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:52,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:52,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:52,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:52,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:52,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:52,280 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:58:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:53,422 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:58:53,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:53,422 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:53,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:53,423 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:58:53,423 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:58:53,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:58:53,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2018-12-03 16:58:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:58:53,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:58:53,986 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:58:53,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:53,986 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:58:53,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:58:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:53,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:53,986 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:58:53,986 INFO L423 AbstractCegarLoop]: === Iteration 398 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:53,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:53,986 INFO L82 PathProgramCache]: Analyzing trace with hash -564169412, now seen corresponding path program 382 times [2018-12-03 16:58:53,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:53,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:53,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:53,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:53,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:54,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:54,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:54,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:54,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 16:58:54,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:54,051 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 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 398 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:54,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:54,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:54,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:54,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:54,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:54,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:54,208 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:54,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:54,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:54,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:54,208 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:58:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:55,289 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:58:55,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:55,289 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:55,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:55,289 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:58:55,289 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:58:55,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:58:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:58:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:58:55,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:58:55,812 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:58:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:55,812 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:58:55,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:58:55,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:55,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:55,813 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:55,813 INFO L423 AbstractCegarLoop]: === Iteration 399 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:55,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:55,813 INFO L82 PathProgramCache]: Analyzing trace with hash -564167490, now seen corresponding path program 383 times [2018-12-03 16:58:55,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:55,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:55,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:55,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:55,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:55,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:55,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:55,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:55,885 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:58:55,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:55,885 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 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 399 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:55,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:55,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:55,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:58:55,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:55,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:55,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:55,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:56,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:56,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:56,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:56,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:56,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:56,211 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:58:57,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:57,299 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:58:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:57,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:57,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:57,300 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:58:57,300 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:58:57,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:58:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:58:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2018-12-03 16:58:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:58:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:58:57,712 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:58:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:57,712 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:58:57,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:58:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:57,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:57,713 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:58:57,713 INFO L423 AbstractCegarLoop]: === Iteration 400 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:57,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:57,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1151673024, now seen corresponding path program 384 times [2018-12-03 16:58:57,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:57,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:57,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:57,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:57,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:57,793 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:57,793 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:58:57,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:57,793 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 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 400 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:57,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:57,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:57,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:57,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:57,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:57,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:57,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:57,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:57,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:57,948 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:57,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:57,948 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 16:58:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:59,080 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:58:59,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:58:59,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:58:59,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:59,081 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:58:59,081 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:58:59,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:59,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:58:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:58:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:58:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:58:59,607 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:58:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:59,607 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:58:59,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:58:59,607 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:58:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:58:59,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:59,608 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:58:59,608 INFO L423 AbstractCegarLoop]: === Iteration 401 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:59,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:59,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1151674946, now seen corresponding path program 385 times [2018-12-03 16:58:59,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:59,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:59,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:59,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:59,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:59,694 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:59,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:59,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:59,694 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:59,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 16:58:59,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:59,695 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 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 401 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:59,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:59,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:59,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:59,712 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:59,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:59,813 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:59,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:59,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:58:59,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:59,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:58:59,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:58:59,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:58:59,832 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:00,938 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:59:00,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:00,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:00,938 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:59:00,938 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:59:00,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:00,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:59:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-12-03 16:59:01,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:59:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:59:01,464 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:59:01,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:01,464 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:59:01,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:59:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:01,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:01,464 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:01,464 INFO L423 AbstractCegarLoop]: === Iteration 402 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:01,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:01,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1151732606, now seen corresponding path program 386 times [2018-12-03 16:59:01,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:01,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:01,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:01,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:01,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:01,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:01,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:01,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:01,542 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:59:01,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:01,542 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 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 402 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:01,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:01,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:01,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:01,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:01,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:01,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:01,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:01,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:01,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:01,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:01,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:01,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:01,688 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:59:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:02,795 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:59:02,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:02,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:02,796 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:59:02,796 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:59:02,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:59:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 16:59:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:03,329 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:03,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:03,329 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:03,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:03,330 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:03,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:03,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:03,330 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:03,330 INFO L423 AbstractCegarLoop]: === Iteration 403 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:03,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1151734528, now seen corresponding path program 387 times [2018-12-03 16:59:03,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:03,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:03,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:03,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:03,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:03,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:03,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:03,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:03,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:03,422 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:59:03,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:03,422 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 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 403 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:03,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:03,431 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:03,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:03,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:03,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:03,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:03,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:03,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:03,547 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:03,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:03,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:03,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:03,548 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:04,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:04,589 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:59:04,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:04,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:04,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:04,590 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:59:04,590 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:59:04,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:04,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:59:05,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 16:59:05,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:59:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:59:05,089 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:59:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:05,090 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:59:05,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:05,090 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:59:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:05,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:05,090 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:05,090 INFO L423 AbstractCegarLoop]: === Iteration 404 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:05,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1153520066, now seen corresponding path program 388 times [2018-12-03 16:59:05,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:05,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:05,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:05,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:05,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:05,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:05,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:05,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:05,157 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:59:05,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:05,157 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 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 404 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:05,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:05,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:05,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:05,173 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:05,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:05,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:05,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:05,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:05,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:05,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:05,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:05,310 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:59:06,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:06,403 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:59:06,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:06,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:06,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:06,404 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:59:06,404 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:59:06,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:06,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:59:06,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:59:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:06,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:06,933 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:06,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:06,933 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:06,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:06,933 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:06,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:06,933 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:06,933 INFO L423 AbstractCegarLoop]: === Iteration 405 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:06,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1153521988, now seen corresponding path program 389 times [2018-12-03 16:59:06,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:06,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:06,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:06,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:06,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:07,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:07,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:07,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:07,000 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:59:07,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:07,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 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 405 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:07,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:07,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:07,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:07,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:07,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:07,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:07,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:07,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:07,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:07,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:07,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:07,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:07,255 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:08,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:08,376 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:59:08,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:08,376 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:08,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:08,377 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:59:08,377 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:59:08,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:59:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-12-03 16:59:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:59:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:59:08,905 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:59:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:08,905 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:59:08,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:59:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:08,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:08,905 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:08,905 INFO L423 AbstractCegarLoop]: === Iteration 406 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:08,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1153579648, now seen corresponding path program 390 times [2018-12-03 16:59:08,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:08,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:08,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:08,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:08,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:08,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:08,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:08,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:08,980 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:59:08,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:08,980 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 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 406 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:08,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:08,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:08,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:08,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:08,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:08,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:08,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:09,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:09,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:09,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:09,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:09,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:09,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:09,143 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:59:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:10,249 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:59:10,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:10,249 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:10,250 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:59:10,250 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:59:10,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:59:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 16:59:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:10,798 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:10,798 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:10,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:10,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:10,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:10,799 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:10,799 INFO L423 AbstractCegarLoop]: === Iteration 407 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:10,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:10,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1153581570, now seen corresponding path program 391 times [2018-12-03 16:59:10,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:10,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:10,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:10,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:10,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:10,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:10,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:10,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:10,865 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:59:10,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:10,865 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 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 407 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:10,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:10,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:10,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:10,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:10,979 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:10,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:10,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:10,997 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:10,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:10,998 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:12,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:12,029 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:59:12,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:12,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:12,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:12,029 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:59:12,030 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:59:12,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:59:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 17. [2018-12-03 16:59:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:59:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:59:12,615 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:59:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:12,615 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:59:12,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:59:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:12,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:12,615 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:12,615 INFO L423 AbstractCegarLoop]: === Iteration 408 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:12,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:12,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1208931326, now seen corresponding path program 392 times [2018-12-03 16:59:12,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:12,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:12,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:12,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:12,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:12,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:12,683 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:12,683 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:59:12,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:12,683 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 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 408 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:12,692 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:12,692 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:12,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:12,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:12,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:12,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:12,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:12,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:12,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:12,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:12,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:12,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:12,845 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:59:13,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:13,882 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:59:13,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:13,882 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:13,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:13,883 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:59:13,883 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:59:13,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:13,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:59:14,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 16:59:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:14,415 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:14,415 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:14,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:14,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:14,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:14,415 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:14,415 INFO L423 AbstractCegarLoop]: === Iteration 409 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:14,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:14,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1208933248, now seen corresponding path program 393 times [2018-12-03 16:59:14,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:14,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:14,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:14,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:14,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:14,488 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:14,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:14,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:14,488 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:14,488 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:59:14,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:14,488 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 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 409 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:14,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:14,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:14,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:14,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:14,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:14,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:14,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:14,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:14,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:14,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:14,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:14,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:14,637 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:15,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:15,668 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:59:15,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:15,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:15,668 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:59:15,668 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:59:15,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:59:16,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 16:59:16,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:59:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:59:16,209 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:59:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:16,209 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:59:16,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:59:16,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:16,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:16,209 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:16,209 INFO L423 AbstractCegarLoop]: === Iteration 410 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:16,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1208990908, now seen corresponding path program 394 times [2018-12-03 16:59:16,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:16,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:16,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:16,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:16,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:16,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:16,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:16,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:16,276 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:59:16,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:16,276 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 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 410 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:16,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:16,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:16,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:16,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:16,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:16,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:16,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:16,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:16,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:16,428 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:59:17,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:17,470 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 16:59:17,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:17,470 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:17,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:17,471 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:59:17,471 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:59:17,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:59:18,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 16:59:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:18,008 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:18,008 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:18,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:18,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:18,008 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:18,008 INFO L423 AbstractCegarLoop]: === Iteration 411 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:18,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:18,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1208992830, now seen corresponding path program 395 times [2018-12-03 16:59:18,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:18,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:18,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:18,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:18,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:18,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:18,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:18,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:18,074 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:59:18,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:18,074 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 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 411 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:18,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:18,086 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:18,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:18,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:18,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:18,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:18,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:18,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:18,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:18,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:18,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:18,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:18,255 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:19,271 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 16:59:19,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:19,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:19,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:19,272 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:59:19,272 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:59:19,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:19,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:59:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 16:59:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:59:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:59:19,771 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:59:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:19,771 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:59:19,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:59:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:19,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:19,772 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:19,772 INFO L423 AbstractCegarLoop]: === Iteration 412 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:19,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:19,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1210778368, now seen corresponding path program 396 times [2018-12-03 16:59:19,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:19,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:19,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:19,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:19,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:19,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:19,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:19,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:19,841 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:59:19,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:19,841 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 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 412 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:19,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:19,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:19,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:19,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:19,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:19,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:19,968 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:19,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:19,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:19,986 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:19,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:19,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:19,986 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:59:20,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:20,953 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:59:20,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:20,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:20,954 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:59:20,954 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:59:20,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:59:21,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 16:59:21,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:21,491 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:21,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:21,492 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:21,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:21,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:21,492 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:21,492 INFO L423 AbstractCegarLoop]: === Iteration 413 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:21,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:21,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1210780290, now seen corresponding path program 397 times [2018-12-03 16:59:21,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:21,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:21,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:21,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:21,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:21,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:21,559 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:21,559 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:21,559 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:59:21,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:21,559 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 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 413 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:21,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:21,567 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:21,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:21,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:21,878 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:21,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:21,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:21,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:21,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:21,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:21,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:21,897 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:22,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:22,855 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 16:59:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:22,855 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:22,856 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:59:22,856 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:59:22,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:59:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:59:23,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 16:59:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:59:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:59:23,382 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:59:23,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:23,382 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:59:23,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:23,382 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:59:23,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:23,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:23,382 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:23,383 INFO L423 AbstractCegarLoop]: === Iteration 414 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:23,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:23,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1210837950, now seen corresponding path program 398 times [2018-12-03 16:59:23,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:23,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:23,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:23,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:23,450 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:23,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:23,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:23,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:23,450 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:59:23,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:23,451 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 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 414 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:23,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:23,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:23,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:23,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:23,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:23,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:23,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:23,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:23,594 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:23,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:23,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:23,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:23,594 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:59:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:24,531 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 16:59:24,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:24,531 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:24,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:24,532 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:59:24,532 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:59:24,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:59:25,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-12-03 16:59:25,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:25,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:25,093 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:25,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:25,093 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:25,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:25,093 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:25,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:25,093 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:59:25,093 INFO L423 AbstractCegarLoop]: === Iteration 415 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:25,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:25,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1210839872, now seen corresponding path program 399 times [2018-12-03 16:59:25,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:25,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:25,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:25,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:25,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:25,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:25,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:25,160 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:59:25,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:25,160 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 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 415 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:25,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:25,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:25,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:25,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:25,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:25,178 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:25,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:25,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:25,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:25,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:25,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:25,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:25,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:25,326 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:26,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:26,227 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 16:59:26,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:26,227 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:26,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:26,228 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:59:26,228 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:59:26,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:26,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:59:26,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 15. [2018-12-03 16:59:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:59:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 16:59:26,613 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 16:59:26,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:26,613 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 16:59:26,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 16:59:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:26,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:26,613 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:59:26,614 INFO L423 AbstractCegarLoop]: === Iteration 416 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:26,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:26,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1432680964, now seen corresponding path program 400 times [2018-12-03 16:59:26,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:26,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:26,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:26,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:26,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:26,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:26,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:26,680 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:26,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:26,681 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:59:26,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:26,681 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 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 416 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:26,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:26,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:26,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:26,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:26,990 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:27,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:27,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:27,008 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:27,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:27,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:27,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:27,008 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 16:59:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:28,309 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:59:28,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:28,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:28,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:28,309 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:59:28,309 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:59:28,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 16:59:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:59:28,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:59:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:28,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:28,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:28,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:28,872 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:28,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:28,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:28,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:28,872 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:28,872 INFO L423 AbstractCegarLoop]: === Iteration 417 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:28,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:28,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1432679042, now seen corresponding path program 401 times [2018-12-03 16:59:28,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:28,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:28,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:28,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:28,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:28,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:28,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:28,943 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:28,943 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:59:28,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:28,943 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 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 417 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:28,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:28,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:28,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:28,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:28,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:28,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:29,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:29,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:29,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:29,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:29,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:29,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:29,101 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:30,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:30,375 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:59:30,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:30,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:30,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:30,375 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:59:30,376 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:59:30,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:59:30,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-03 16:59:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:59:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:59:30,932 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:59:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:30,932 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:59:30,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:30,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:59:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:30,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:30,933 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:30,933 INFO L423 AbstractCegarLoop]: === Iteration 418 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:30,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:30,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1432621382, now seen corresponding path program 402 times [2018-12-03 16:59:30,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:30,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:30,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:30,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:30,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:31,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:31,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:31,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:31,002 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:59:31,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:31,002 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 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 418 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:31,010 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:31,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:31,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:31,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:31,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:31,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:31,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:31,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:31,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:31,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:31,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:31,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:31,159 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:59:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:32,503 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:59:32,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:32,503 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:32,504 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:59:32,504 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:59:32,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:32,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:59:33,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:59:33,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:33,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:33,099 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:33,099 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:33,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:33,099 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:33,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:33,099 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:33,099 INFO L423 AbstractCegarLoop]: === Iteration 419 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:33,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:33,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1432619460, now seen corresponding path program 403 times [2018-12-03 16:59:33,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:33,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:33,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:33,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:33,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:33,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:33,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:33,171 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:33,171 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:59:33,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:33,171 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 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 419 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:33,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:33,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:33,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:33,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:33,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:33,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:33,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:33,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:33,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:33,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:33,370 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:34,642 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:59:34,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:34,642 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:34,643 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:59:34,643 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:59:34,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:34,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:59:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-12-03 16:59:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:59:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:59:35,173 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:59:35,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:35,174 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:59:35,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:35,174 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:59:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:35,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:35,174 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:35,174 INFO L423 AbstractCegarLoop]: === Iteration 420 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:35,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1430833922, now seen corresponding path program 404 times [2018-12-03 16:59:35,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:35,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:35,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:35,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:35,241 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:35,241 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:59:35,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:35,241 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 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 420 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:35,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:35,252 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:35,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:35,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:35,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:35,382 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:35,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:35,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:35,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:35,401 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:59:36,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:36,660 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:59:36,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:36,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:36,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:36,660 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:59:36,661 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:59:36,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:36,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:59:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 16:59:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:37,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:37,222 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:37,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:37,222 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:37,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:37,222 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:37,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:37,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:37,222 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:37,222 INFO L423 AbstractCegarLoop]: === Iteration 421 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:37,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:37,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1430832000, now seen corresponding path program 405 times [2018-12-03 16:59:37,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:37,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:37,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:37,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:37,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:37,325 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:37,325 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:59:37,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:37,326 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 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 421 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:37,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:37,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:37,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:37,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:37,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:37,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:37,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:37,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:37,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:37,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:37,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:37,495 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:38,733 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:59:38,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:38,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:38,734 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:59:38,734 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:59:38,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:38,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:59:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2018-12-03 16:59:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:59:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:59:39,313 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:59:39,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:39,313 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:59:39,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:59:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:39,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:39,314 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:39,314 INFO L423 AbstractCegarLoop]: === Iteration 422 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:39,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:39,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1430774340, now seen corresponding path program 406 times [2018-12-03 16:59:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:39,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:39,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:39,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:39,387 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:39,387 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:39,387 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:59:39,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:39,387 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 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 422 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:39,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:39,397 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:39,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:39,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:39,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:39,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:39,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:39,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:39,537 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:59:40,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:40,710 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:59:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:40,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:40,710 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:59:40,710 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:59:40,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:59:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:59:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:41,314 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:41,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:41,314 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:41,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:41,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:41,314 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:41,315 INFO L423 AbstractCegarLoop]: === Iteration 423 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:41,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:41,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1430772418, now seen corresponding path program 407 times [2018-12-03 16:59:41,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:41,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:41,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:41,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:41,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:41,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:41,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:41,382 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:41,382 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:59:41,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:41,382 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 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 423 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:41,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:41,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:41,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:41,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:41,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:41,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:41,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:41,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:41,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:41,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:41,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:41,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:41,531 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:42,696 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:59:42,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:42,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:42,697 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:59:42,697 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:59:42,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:42,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:59:43,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 17. [2018-12-03 16:59:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:59:43,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 16:59:43,181 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 16:59:43,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:43,181 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 16:59:43,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:43,181 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 16:59:43,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:43,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:43,181 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:43,182 INFO L423 AbstractCegarLoop]: === Iteration 424 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:43,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:43,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1375422662, now seen corresponding path program 408 times [2018-12-03 16:59:43,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:43,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:43,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:43,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:43,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:43,248 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:43,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:43,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:43,248 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:43,248 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:59:43,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:43,248 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 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 424 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:43,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:43,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:43,262 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:43,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:43,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:43,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:43,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:43,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:43,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:43,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:43,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:43,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:43,409 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 16:59:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:44,758 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:59:44,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:44,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:44,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:44,759 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:59:44,759 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:59:44,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:59:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:59:45,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:45,320 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:45,320 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:45,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:45,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:45,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:45,320 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:45,321 INFO L423 AbstractCegarLoop]: === Iteration 425 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:45,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:45,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1375420740, now seen corresponding path program 409 times [2018-12-03 16:59:45,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:45,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:45,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:45,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:45,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:45,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:45,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:45,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:45,406 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:59:45,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:45,407 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 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 425 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:45,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:45,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:45,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:45,421 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:45,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:45,534 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:45,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:45,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:45,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:45,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:45,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:45,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:45,553 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:46,875 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:59:46,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:46,875 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:46,876 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:59:46,876 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:59:46,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:59:47,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 19. [2018-12-03 16:59:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:59:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:59:47,438 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:59:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:47,438 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:59:47,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:59:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:47,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:47,438 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:47,439 INFO L423 AbstractCegarLoop]: === Iteration 426 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:47,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:47,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1375363080, now seen corresponding path program 410 times [2018-12-03 16:59:47,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:47,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:47,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:47,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:47,578 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:47,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:47,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:47,578 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:47,578 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:59:47,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:47,579 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 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 426 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:47,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:47,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:47,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:47,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:47,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:47,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:47,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:47,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:47,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:47,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:47,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:47,735 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:59:49,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:49,083 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 16:59:49,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:49,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:49,084 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:59:49,084 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:59:49,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:49,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:59:49,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 16:59:49,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:49,653 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:49,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:49,653 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:49,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:49,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:49,654 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:49,654 INFO L423 AbstractCegarLoop]: === Iteration 427 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:49,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:49,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1375361158, now seen corresponding path program 411 times [2018-12-03 16:59:49,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:49,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:49,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:49,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:49,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:49,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:49,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:49,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:49,721 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:59:49,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:49,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 427 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:49,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:49,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:49,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:49,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:49,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:49,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:49,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:49,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:49,867 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:49,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:49,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:49,868 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:51,138 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 16:59:51,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:51,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:51,138 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:59:51,139 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:59:51,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:59:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 18. [2018-12-03 16:59:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:59:51,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 16:59:51,684 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 16:59:51,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:51,684 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 16:59:51,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 16:59:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:51,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:51,684 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 16:59:51,685 INFO L423 AbstractCegarLoop]: === Iteration 428 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:51,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:51,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1373575620, now seen corresponding path program 412 times [2018-12-03 16:59:51,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:51,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:51,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:51,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:51,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:51,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:51,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:51,755 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:59:51,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:51,756 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 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 428 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:51,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:51,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:51,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:51,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:51,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:51,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:51,912 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:51,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:51,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:51,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:51,912 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 16:59:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:53,165 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:59:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:53,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:53,166 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:59:53,166 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:59:53,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:59:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 16:59:53,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:53,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:53,758 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:53,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:53,758 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:53,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:53,758 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:53,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:53,758 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:53,759 INFO L423 AbstractCegarLoop]: === Iteration 429 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:53,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:53,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1373573698, now seen corresponding path program 413 times [2018-12-03 16:59:53,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:53,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:53,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:53,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:53,759 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:53,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:53,829 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:59:53,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,829 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 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 429 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:53,838 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:53,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:53,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:53,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:53,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:53,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:53,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:53,989 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:53,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:53,989 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:55,248 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 16:59:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:55,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:55,249 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:59:55,249 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:59:55,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:55,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:59:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 19. [2018-12-03 16:59:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:59:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 16:59:55,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 16:59:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:55,814 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 16:59:55,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 16:59:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:55,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:55,814 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:55,815 INFO L423 AbstractCegarLoop]: === Iteration 430 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:55,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1373516038, now seen corresponding path program 414 times [2018-12-03 16:59:55,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:55,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:55,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:55,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:55,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:55,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:55,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:55,880 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:55,880 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:59:55,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:55,880 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 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 430 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:55,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:55,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:55,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:55,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:55,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:55,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:56,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:56,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:56,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:56,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:56,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:56,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:56,026 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 16:59:57,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:57,242 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 16:59:57,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:57,242 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:57,243 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:59:57,243 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:59:57,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:57,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:59:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 16:59:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 16:59:57,875 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 16:59:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:57,875 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 16:59:57,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:57,875 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 16:59:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:57,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:57,875 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 16:59:57,875 INFO L423 AbstractCegarLoop]: === Iteration 431 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:57,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:57,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1373514116, now seen corresponding path program 415 times [2018-12-03 16:59:57,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:57,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:57,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:57,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:57,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:57,950 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:57,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:57,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:57,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:57,951 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:59:57,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:57,951 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 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 431 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:57,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:57,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:57,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:57,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:58,071 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:58,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:58,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:58,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:58,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:58,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:58,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:58,089 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 16:59:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:59,240 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 16:59:59,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:59,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:59:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:59,240 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:59:59,240 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:59:59,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:59,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:59:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 16. [2018-12-03 16:59:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:59:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 16:59:59,700 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 16:59:59,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:59,700 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 16:59:59,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:59,700 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 16:59:59,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:59,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:59,700 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 16:59:59,700 INFO L423 AbstractCegarLoop]: === Iteration 432 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:59,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:59,700 INFO L82 PathProgramCache]: Analyzing trace with hash 342326398, now seen corresponding path program 416 times [2018-12-03 16:59:59,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:59,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:59,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:59,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:59,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:59,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:59,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:59,771 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:59,771 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:59:59,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:59,771 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 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 432 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:59,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:59,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:59,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:59,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:59,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:59,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:59,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:59,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:59,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:59:59,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:59,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:59,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:59,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:59:59,937 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 17:00:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:01,172 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:00:01,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:01,173 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:01,173 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:00:01,173 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:00:01,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:00:01,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 17:00:01,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:01,765 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:01,765 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:01,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:01,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:01,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:01,765 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:01,765 INFO L423 AbstractCegarLoop]: === Iteration 433 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:01,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:01,765 INFO L82 PathProgramCache]: Analyzing trace with hash 342328320, now seen corresponding path program 417 times [2018-12-03 17:00:01,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:01,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:01,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:01,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:01,831 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:01,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:01,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:01,831 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:01,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:01,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:01,832 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 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 433 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:01,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:01,840 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:01,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:01,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:01,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:01,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:01,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:01,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:01,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:01,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:01,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:01,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:01,994 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:03,194 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:00:03,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:03,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:03,195 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:00:03,195 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:00:03,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:03,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:00:03,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-12-03 17:00:03,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:00:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:00:03,765 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:00:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:03,765 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:00:03,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:00:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:03,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:03,766 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:03,766 INFO L423 AbstractCegarLoop]: === Iteration 434 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:03,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash 342385980, now seen corresponding path program 418 times [2018-12-03 17:00:03,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:03,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:03,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:03,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:03,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:03,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:03,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:03,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:03,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:03,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:03,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:03,834 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 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 434 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:03,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:03,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:03,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:03,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:03,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:03,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:03,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:03,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:03,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:03,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:03,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:03,977 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:00:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:05,161 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:00:05,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:05,161 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:05,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:05,162 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:00:05,162 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:00:05,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:05,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:00:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 17:00:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:05,749 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:05,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:05,749 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:05,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:05,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:05,749 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:05,749 INFO L423 AbstractCegarLoop]: === Iteration 435 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:05,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash 342387902, now seen corresponding path program 419 times [2018-12-03 17:00:05,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:05,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:05,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:05,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:05,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:05,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:05,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:05,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:05,818 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:05,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:05,818 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 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 435 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:05,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:05,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:05,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:00:05,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:05,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:05,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:05,959 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:05,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:05,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:05,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:05,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:05,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:05,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:05,979 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:07,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:07,102 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:00:07,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:07,102 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:07,103 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:00:07,103 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:00:07,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:07,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:00:07,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 17:00:07,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:00:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:00:07,646 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:00:07,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:07,646 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:00:07,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:00:07,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:07,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:07,646 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:07,646 INFO L423 AbstractCegarLoop]: === Iteration 436 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:07,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:07,646 INFO L82 PathProgramCache]: Analyzing trace with hash 344173440, now seen corresponding path program 420 times [2018-12-03 17:00:07,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:07,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:07,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:07,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:07,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:07,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:07,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:07,740 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:07,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:07,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:07,740 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 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 436 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:07,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:07,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:07,755 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:07,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:07,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:07,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:08,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:08,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:08,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:08,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:08,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:08,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:08,146 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:00:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:09,369 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:00:09,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:09,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:09,370 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:00:09,370 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:00:09,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:09,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:00:09,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 17:00:09,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:09,953 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:09,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:09,954 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:09,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:09,954 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:09,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:09,954 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:09,954 INFO L423 AbstractCegarLoop]: === Iteration 437 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:09,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash 344175362, now seen corresponding path program 421 times [2018-12-03 17:00:09,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:09,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:09,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:10,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:10,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:10,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:10,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:10,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:10,024 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 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 437 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:10,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:10,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:10,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:10,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:10,148 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:10,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:10,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:10,167 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:10,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:10,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:10,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:10,167 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:11,369 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:00:11,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:11,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:11,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:11,370 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:00:11,370 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:00:11,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:11,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:00:11,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 19. [2018-12-03 17:00:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:00:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:00:11,938 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:00:11,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:11,938 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:00:11,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:11,938 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:00:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:11,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:11,938 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:11,938 INFO L423 AbstractCegarLoop]: === Iteration 438 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:11,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash 344233022, now seen corresponding path program 422 times [2018-12-03 17:00:11,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:11,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:11,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:11,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:11,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:12,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:12,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:12,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:12,006 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:12,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:12,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:12,006 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 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 438 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:12,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:12,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:12,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:00:12,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:12,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:12,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:12,145 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:12,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:12,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:12,163 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:12,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:12,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:12,164 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:00:13,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:13,322 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:00:13,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:13,322 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:13,323 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:00:13,323 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:00:13,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:00:13,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 17:00:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:13,902 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:13,902 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:13,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:13,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:13,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:13,903 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:00:13,903 INFO L423 AbstractCegarLoop]: === Iteration 439 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:13,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash 344234944, now seen corresponding path program 423 times [2018-12-03 17:00:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:13,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:13,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:13,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:13,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:13,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:13,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:13,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:13,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:13,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:13,976 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 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 439 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:13,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:13,985 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:13,990 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:13,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:13,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:13,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:13,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:14,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:14,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:14,161 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:14,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:14,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:14,161 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:15,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:15,298 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:00:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:15,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:15,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:15,299 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:00:15,299 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:00:15,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:15,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:00:15,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 17. [2018-12-03 17:00:15,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:00:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 17:00:15,819 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 17:00:15,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:15,820 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 17:00:15,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 17:00:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:15,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:15,820 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:15,820 INFO L423 AbstractCegarLoop]: === Iteration 440 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:15,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:15,820 INFO L82 PathProgramCache]: Analyzing trace with hash 399584700, now seen corresponding path program 424 times [2018-12-03 17:00:15,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:15,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:15,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:15,821 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:15,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:15,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:15,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:15,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:15,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:15,887 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 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 440 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:15,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:15,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:15,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:15,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:16,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:16,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:16,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:16,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:16,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:16,033 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 17:00:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:17,162 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:00:17,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:17,162 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:17,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:17,163 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:00:17,163 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:00:17,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:17,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:00:17,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 17:00:17,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:17,764 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:17,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:17,764 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:17,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:17,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:17,764 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:17,764 INFO L423 AbstractCegarLoop]: === Iteration 441 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:17,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash 399586622, now seen corresponding path program 425 times [2018-12-03 17:00:17,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:17,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:17,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:17,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:17,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:17,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:17,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:17,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:17,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:17,834 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 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 441 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:17,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:17,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:17,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:00:17,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:17,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:17,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:18,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:18,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:18,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:18,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:18,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:18,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:18,273 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:19,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:19,368 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:00:19,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:19,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:19,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:19,369 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:00:19,369 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:00:19,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:00:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 17:00:19,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:00:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:00:19,956 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:00:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:19,956 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:00:19,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:00:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:19,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:19,956 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:19,956 INFO L423 AbstractCegarLoop]: === Iteration 442 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:19,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash 399644282, now seen corresponding path program 426 times [2018-12-03 17:00:19,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:19,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:19,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:20,025 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:20,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:20,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:20,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:20,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 17:00:20,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:20,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 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 442 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:20,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:20,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:20,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:20,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:20,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:20,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:20,185 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:20,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:20,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:20,204 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:20,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:20,205 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:00:21,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:21,338 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:00:21,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:21,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:21,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:21,339 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:00:21,339 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:00:21,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:00:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 17:00:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:21,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:21,929 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:21,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:21,929 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:21,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:21,929 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:21,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:21,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:21,930 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:00:21,930 INFO L423 AbstractCegarLoop]: === Iteration 443 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:21,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash 399646204, now seen corresponding path program 427 times [2018-12-03 17:00:21,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:21,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:21,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:21,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:21,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:21,996 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:21,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:21,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:21,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:21,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:21,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:21,996 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 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 443 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:22,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:22,006 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:22,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:22,013 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:22,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:22,122 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:22,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:22,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:22,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:22,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:22,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:22,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:22,142 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:23,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:23,252 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:00:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:23,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:23,253 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:00:23,253 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:00:23,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:00:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 17:00:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:00:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:00:23,804 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:00:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:23,804 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:00:23,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:00:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:23,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:23,805 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:23,805 INFO L423 AbstractCegarLoop]: === Iteration 444 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:23,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash 401431742, now seen corresponding path program 428 times [2018-12-03 17:00:23,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:23,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:23,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:23,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:23,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:23,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:23,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:23,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:23,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:23,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:23,874 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 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 444 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:23,883 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:23,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:23,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:00:23,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:23,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:23,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:24,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:24,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:24,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:24,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:24,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:24,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:24,043 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:00:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:25,105 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:00:25,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:25,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:25,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:25,106 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:00:25,106 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:00:25,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:00:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 17:00:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:25,701 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:25,701 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:25,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:25,702 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:25,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:25,702 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:00:25,702 INFO L423 AbstractCegarLoop]: === Iteration 445 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:25,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:25,702 INFO L82 PathProgramCache]: Analyzing trace with hash 401433664, now seen corresponding path program 429 times [2018-12-03 17:00:25,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:25,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:25,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:25,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:25,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:25,769 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:25,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:25,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:25,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:25,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:25,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:25,769 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 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 445 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:25,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:25,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:25,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:25,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:25,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:25,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:25,895 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:25,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:25,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:25,915 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:25,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:25,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:25,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:25,915 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:26,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:26,965 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:00:26,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:26,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:26,965 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:00:26,965 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:00:26,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:00:27,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 17:00:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:00:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:00:27,556 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:00:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:27,556 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:00:27,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:27,556 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:00:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:27,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:27,556 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:00:27,556 INFO L423 AbstractCegarLoop]: === Iteration 446 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:27,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash 401491324, now seen corresponding path program 430 times [2018-12-03 17:00:27,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:27,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:27,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:27,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:27,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:27,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:27,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:27,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:27,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:27,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:27,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 446 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:27,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:27,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:27,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:27,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:27,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:27,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:27,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:27,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:27,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:27,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:27,779 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:00:28,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:28,788 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:00:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:28,788 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:28,789 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:00:28,789 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:00:28,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:00:29,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-12-03 17:00:29,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:29,385 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:29,385 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:29,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:29,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:29,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:29,385 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 17:00:29,385 INFO L423 AbstractCegarLoop]: === Iteration 447 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:29,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:29,386 INFO L82 PathProgramCache]: Analyzing trace with hash 401493246, now seen corresponding path program 431 times [2018-12-03 17:00:29,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:29,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:29,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:29,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:29,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:29,454 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:29,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:29,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,454 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 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 447 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:29,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:29,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:29,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:00:29,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:29,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:29,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:29,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:29,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:29,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:29,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:29,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:29,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:29,599 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:30,600 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 17:00:30,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:30,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:30,601 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:00:30,601 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:00:30,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:30,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:00:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 14. [2018-12-03 17:00:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:00:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-03 17:00:30,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 11 [2018-12-03 17:00:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:30,980 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-03 17:00:30,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-03 17:00:30,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:30,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:30,980 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:00:30,980 INFO L423 AbstractCegarLoop]: === Iteration 448 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:30,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:30,980 INFO L82 PathProgramCache]: Analyzing trace with hash 56724032, now seen corresponding path program 432 times [2018-12-03 17:00:30,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:30,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:30,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:30,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:30,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:30,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:31,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:31,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:31,053 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:31,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:31,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:31,053 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 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 448 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:31,063 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:31,063 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:31,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:31,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:31,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:31,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:31,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:31,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:31,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:31,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:31,189 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 11 states. [2018-12-03 17:00:32,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:32,443 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:00:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:32,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:32,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:32,444 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:00:32,444 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:00:32,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:32,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:00:33,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 17:00:33,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:33,079 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:33,079 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:33,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:33,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:33,080 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:33,080 INFO L423 AbstractCegarLoop]: === Iteration 449 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:33,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:33,080 INFO L82 PathProgramCache]: Analyzing trace with hash 56725954, now seen corresponding path program 433 times [2018-12-03 17:00:33,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:33,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:33,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:33,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:33,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:33,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:33,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:33,168 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:33,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:33,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:33,168 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 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 449 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:33,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:33,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:33,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:33,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:33,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:33,455 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:33,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:33,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:33,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:33,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:33,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:33,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:33,474 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:34,737 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:00:34,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:34,737 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:34,738 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:00:34,738 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:00:34,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 17:00:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:00:35,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 17:00:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:00:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:00:35,433 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:00:35,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:35,434 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:00:35,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:00:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:35,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:35,434 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:35,434 INFO L423 AbstractCegarLoop]: === Iteration 450 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:35,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:35,435 INFO L82 PathProgramCache]: Analyzing trace with hash 56783614, now seen corresponding path program 434 times [2018-12-03 17:00:35,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:35,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:35,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:35,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:35,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:35,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:35,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:35,520 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:35,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:35,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:35,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 450 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:35,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:35,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:35,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:00:35,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:35,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:35,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:35,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:35,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:35,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:35,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:35,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:35,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:35,653 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:00:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:36,895 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:00:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:36,895 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:36,895 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:00:36,896 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:00:36,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:36,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:00:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 17:00:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:37,531 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:37,531 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:37,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:37,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:37,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:37,532 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:37,532 INFO L423 AbstractCegarLoop]: === Iteration 451 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:37,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:37,532 INFO L82 PathProgramCache]: Analyzing trace with hash 56785536, now seen corresponding path program 435 times [2018-12-03 17:00:37,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:37,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:37,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:37,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:37,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:37,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:37,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:37,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:37,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:37,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:37,601 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 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 451 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:37,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:37,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:37,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:37,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:37,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:37,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:37,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:37,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:37,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:37,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:37,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:37,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:37,746 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:38,895 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:00:38,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:38,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:38,896 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:00:38,896 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:00:38,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:38,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:00:39,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 17:00:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:00:39,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:00:39,493 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:00:39,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:39,493 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:00:39,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:39,493 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:00:39,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:39,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:39,493 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:39,493 INFO L423 AbstractCegarLoop]: === Iteration 452 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:39,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:39,494 INFO L82 PathProgramCache]: Analyzing trace with hash 58571074, now seen corresponding path program 436 times [2018-12-03 17:00:39,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:39,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:39,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:39,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:39,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:39,561 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:39,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:39,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:39,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:39,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:39,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:39,562 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 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 452 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:39,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:39,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:39,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:39,577 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:39,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:39,692 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:39,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:39,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:39,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:39,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:39,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:39,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:39,712 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:00:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:40,992 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:00:40,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:40,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:40,993 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:00:40,993 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:00:40,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:40,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:00:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 17:00:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:41,639 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:41,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:41,639 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:41,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:41,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:41,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:41,640 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:41,640 INFO L423 AbstractCegarLoop]: === Iteration 453 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:41,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:41,640 INFO L82 PathProgramCache]: Analyzing trace with hash 58572996, now seen corresponding path program 437 times [2018-12-03 17:00:41,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:41,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:41,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:41,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:41,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:41,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:41,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:41,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:41,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 17:00:41,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:41,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 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 453 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:41,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:41,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:41,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:00:41,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:41,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:41,728 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:41,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:41,845 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:41,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:41,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:41,863 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:41,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:41,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:41,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:41,863 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:43,176 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:00:43,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:43,176 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:43,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:43,177 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:00:43,177 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:00:43,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:00:43,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 17:00:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:00:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:00:43,808 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:00:43,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:43,808 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:00:43,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:00:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:43,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:43,809 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:43,809 INFO L423 AbstractCegarLoop]: === Iteration 454 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:43,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:43,809 INFO L82 PathProgramCache]: Analyzing trace with hash 58630656, now seen corresponding path program 438 times [2018-12-03 17:00:43,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:43,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:43,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:43,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:43,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:43,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:43,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:43,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:43,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:43,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:43,898 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 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 454 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:43,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:43,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:43,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:43,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:43,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:43,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:44,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:44,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:44,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:44,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:44,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:44,057 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:00:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:45,303 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:00:45,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:45,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:45,304 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:00:45,304 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:00:45,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:00:45,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 17:00:45,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:45,944 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:45,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:45,944 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:45,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:45,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:45,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:45,945 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:45,945 INFO L423 AbstractCegarLoop]: === Iteration 455 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:45,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:45,945 INFO L82 PathProgramCache]: Analyzing trace with hash 58632578, now seen corresponding path program 439 times [2018-12-03 17:00:45,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:45,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:45,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:45,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:45,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:46,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:46,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:46,045 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:46,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:46,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:46,045 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 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 455 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:46,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:46,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:46,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:46,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:46,182 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:46,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:46,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:46,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:46,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:46,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:46,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:46,200 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:47,417 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:00:47,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:47,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:47,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:47,417 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:00:47,417 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:00:47,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:00:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 17:00:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:00:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 17:00:47,974 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 17:00:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:47,974 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 17:00:47,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 17:00:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:47,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:47,974 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:47,974 INFO L423 AbstractCegarLoop]: === Iteration 456 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:47,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:47,974 INFO L82 PathProgramCache]: Analyzing trace with hash 113982334, now seen corresponding path program 440 times [2018-12-03 17:00:47,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:47,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:47,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:47,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:47,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:48,042 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:48,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:48,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:48,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:48,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:48,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:48,043 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 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 456 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:48,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:48,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:48,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:00:48,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:48,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:48,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:48,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:48,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:48,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:48,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:48,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:48,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:48,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:48,190 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 17:00:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:49,367 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:00:49,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:49,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:49,367 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:00:49,367 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:00:49,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:00:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 17:00:50,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:50,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:50,011 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:50,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:50,011 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:50,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:50,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:50,011 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:50,011 INFO L423 AbstractCegarLoop]: === Iteration 457 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:50,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash 113984256, now seen corresponding path program 441 times [2018-12-03 17:00:50,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:50,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:50,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:50,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:50,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:50,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:50,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:50,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:50,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:50,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:50,080 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 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 457 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:50,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:50,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:50,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:50,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:50,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:50,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:50,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:50,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:50,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:50,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:50,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:50,227 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:51,386 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:00:51,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:51,386 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:51,386 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:00:51,387 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:00:51,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:00:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 17:00:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:00:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:00:52,013 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:00:52,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:52,014 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:00:52,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:52,014 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:00:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:52,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:52,014 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:52,014 INFO L423 AbstractCegarLoop]: === Iteration 458 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:52,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:52,014 INFO L82 PathProgramCache]: Analyzing trace with hash 114041916, now seen corresponding path program 442 times [2018-12-03 17:00:52,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:52,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:52,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:52,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:52,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:52,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:52,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:52,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:52,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:52,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:52,083 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 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 458 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:52,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:52,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:52,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:52,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:52,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:52,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:52,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:52,259 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:52,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:52,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:52,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:52,260 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:00:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:53,443 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:00:53,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:53,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:53,443 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:00:53,444 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:00:53,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:53,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:00:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 17:00:54,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:54,089 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:54,089 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:54,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:54,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:54,089 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:54,089 INFO L423 AbstractCegarLoop]: === Iteration 459 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:54,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:54,090 INFO L82 PathProgramCache]: Analyzing trace with hash 114043838, now seen corresponding path program 443 times [2018-12-03 17:00:54,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:54,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:54,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:54,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:54,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:54,211 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:54,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:54,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:54,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:54,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:54,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:54,212 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 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 459 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:54,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:54,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:54,225 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:00:54,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:54,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:54,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:54,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:54,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:54,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:54,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:54,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:54,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:54,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:54,337 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:55,517 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:00:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:55,517 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:55,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:55,517 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:00:55,517 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:00:55,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:00:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 17:00:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:00:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:00:56,128 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:00:56,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:56,128 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:00:56,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:00:56,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:56,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:56,129 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:00:56,129 INFO L423 AbstractCegarLoop]: === Iteration 460 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:56,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash 115829376, now seen corresponding path program 444 times [2018-12-03 17:00:56,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:56,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:56,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:56,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:56,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:56,196 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:56,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:56,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:56,196 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:56,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:56,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:56,197 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 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 460 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:56,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:56,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:56,213 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:56,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:56,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:56,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:56,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:56,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:56,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:56,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:56,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:56,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:56,361 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:00:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:57,452 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:00:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:57,452 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:57,453 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:00:57,453 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:00:57,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:57,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:00:58,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-12-03 17:00:58,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:00:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:00:58,106 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:00:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:58,106 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:00:58,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:00:58,106 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:00:58,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:00:58,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:58,107 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:00:58,107 INFO L423 AbstractCegarLoop]: === Iteration 461 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:58,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:58,107 INFO L82 PathProgramCache]: Analyzing trace with hash 115831298, now seen corresponding path program 445 times [2018-12-03 17:00:58,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:58,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:58,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:58,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:58,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:58,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:58,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:58,175 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:58,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:58,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:58,175 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 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 461 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:58,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:58,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:58,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:58,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:58,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:58,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:58,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:00:58,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:58,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:00:58,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:00:58,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:58,322 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:00:59,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:59,384 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:00:59,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:00:59,384 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:00:59,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:59,385 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:00:59,385 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:00:59,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:01:00,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 17:01:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:01:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:01:00,019 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:01:00,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:00,019 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:01:00,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:01:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:00,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:00,020 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:00,020 INFO L423 AbstractCegarLoop]: === Iteration 462 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:00,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:00,020 INFO L82 PathProgramCache]: Analyzing trace with hash 115888958, now seen corresponding path program 446 times [2018-12-03 17:01:00,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:00,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:00,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:00,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:00,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:00,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:00,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:00,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:00,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:00,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:00,088 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 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 462 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:00,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:00,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:00,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:00,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:00,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:00,103 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:00,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:00,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:00,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:00,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:00,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:00,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:00,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:00,246 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:01:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:01,284 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 17:01:01,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:01,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:01,285 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:01:01,285 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:01:01,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:01,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:01:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-12-03 17:01:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:01,971 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:01,972 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:01,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:01,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:01,972 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:01:01,972 INFO L423 AbstractCegarLoop]: === Iteration 463 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:01,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:01,972 INFO L82 PathProgramCache]: Analyzing trace with hash 115890880, now seen corresponding path program 447 times [2018-12-03 17:01:01,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:01,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:01,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:01,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:01,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:02,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:02,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:02,046 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:02,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:02,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:02,046 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 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 463 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:02,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:02,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:02,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:02,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:02,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:02,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:02,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:02,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:02,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:02,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:02,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:02,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:02,226 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:03,258 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 17:01:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:03,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:03,258 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:01:03,259 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:01:03,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:01:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-12-03 17:01:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:01:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 17:01:03,759 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 17:01:03,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:03,759 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 17:01:03,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:03,759 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 17:01:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:03,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:03,759 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:03,760 INFO L423 AbstractCegarLoop]: === Iteration 464 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:03,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:03,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1831731394, now seen corresponding path program 448 times [2018-12-03 17:01:03,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:03,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:03,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:03,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:03,825 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:03,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:03,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:03,825 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:03,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:03,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:03,825 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 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 464 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:03,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:03,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:03,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:03,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:03,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:04,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:04,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:04,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:04,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:04,010 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 17:01:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:05,323 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:01:05,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:05,323 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:05,323 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:01:05,323 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:01:05,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:01:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 17:01:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:05,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:05,994 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:05,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:05,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:05,994 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:01:05,994 INFO L423 AbstractCegarLoop]: === Iteration 465 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:05,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:05,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1831733316, now seen corresponding path program 449 times [2018-12-03 17:01:05,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:05,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:05,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:05,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:05,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:05,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:06,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:06,060 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:06,060 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:06,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:06,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:06,060 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 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 465 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:06,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:06,069 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:06,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:06,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:06,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:06,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:06,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:06,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:06,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:06,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:06,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:06,230 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:07,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:07,582 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:01:07,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:07,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:07,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:07,583 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:01:07,583 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:01:07,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:07,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:01:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 17:01:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:01:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:01:08,233 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:01:08,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:08,234 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:01:08,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:08,234 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:01:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:08,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:08,234 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:01:08,234 INFO L423 AbstractCegarLoop]: === Iteration 466 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:08,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1831790976, now seen corresponding path program 450 times [2018-12-03 17:01:08,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:08,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:08,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:08,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:08,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:08,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:08,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:08,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:08,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:08,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:08,303 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 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 466 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:08,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:08,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:08,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:08,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:08,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:08,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:08,447 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:08,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:08,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:08,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:08,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:08,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:08,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:08,467 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:01:09,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:09,758 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:01:09,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:09,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:09,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:09,759 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:01:09,759 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:01:09,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:09,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:01:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 17:01:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:10,457 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:10,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:10,457 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:10,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:10,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:10,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:10,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:10,458 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:10,458 INFO L423 AbstractCegarLoop]: === Iteration 467 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:10,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:10,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1831792898, now seen corresponding path program 451 times [2018-12-03 17:01:10,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:10,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:10,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:10,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:10,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:10,523 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:10,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:10,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:10,523 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:10,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:10,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:10,524 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 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 467 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:10,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:10,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:10,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:10,540 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:10,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:10,664 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:10,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:10,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:10,683 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:10,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:10,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:10,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:10,684 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:11,902 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:01:11,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:11,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:11,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:11,902 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:01:11,902 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:01:11,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:11,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:01:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2018-12-03 17:01:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:01:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:01:12,517 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:01:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:12,517 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:01:12,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:01:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:12,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:12,517 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:01:12,517 INFO L423 AbstractCegarLoop]: === Iteration 468 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:12,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:12,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1833578436, now seen corresponding path program 452 times [2018-12-03 17:01:12,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:12,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:12,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:12,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:12,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:12,584 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:12,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:12,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:12,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:12,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:12,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:12,585 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 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 468 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:12,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:12,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:12,600 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:12,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:12,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:12,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:12,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:12,732 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:12,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:12,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:12,750 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:12,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:12,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:12,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:12,751 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:01:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:14,056 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:01:14,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:14,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:14,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:14,056 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:01:14,056 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:01:14,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:01:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-12-03 17:01:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:14,718 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:14,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:14,718 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:14,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:14,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:14,719 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:14,719 INFO L423 AbstractCegarLoop]: === Iteration 469 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:14,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:14,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1833580358, now seen corresponding path program 453 times [2018-12-03 17:01:14,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:14,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:14,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:14,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:14,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:14,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:14,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:14,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:14,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 17:01:14,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:14,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 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 469 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:14,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:14,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:14,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:14,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:14,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:14,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:14,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:14,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:14,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:14,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:14,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:14,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:14,955 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:16,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:16,264 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:01:16,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:16,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:16,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:16,264 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:01:16,264 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:01:16,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:01:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 17:01:16,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:01:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:01:16,922 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:01:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:16,922 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:01:16,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:01:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:16,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:16,923 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:16,923 INFO L423 AbstractCegarLoop]: === Iteration 470 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:16,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:16,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1833638018, now seen corresponding path program 454 times [2018-12-03 17:01:16,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:16,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:16,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:16,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:16,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:16,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:16,990 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:16,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:16,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:16,990 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 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 470 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:17,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:17,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:17,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:17,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:17,156 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:17,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:17,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:17,174 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:17,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:17,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:17,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:17,175 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:01:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:18,454 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:01:18,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:18,454 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:18,454 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:01:18,454 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:01:18,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:01:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 17:01:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:19,133 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:19,133 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:19,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:19,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:19,133 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:01:19,133 INFO L423 AbstractCegarLoop]: === Iteration 471 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:19,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:19,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1833639940, now seen corresponding path program 455 times [2018-12-03 17:01:19,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:19,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:19,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:19,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:19,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:19,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:19,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:19,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:19,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:19,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:19,204 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 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 471 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:19,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:19,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:19,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:19,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:19,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:19,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:19,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:19,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:19,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:19,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:19,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:19,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:19,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:19,375 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:20,589 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:01:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:20,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:20,590 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:01:20,590 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:01:20,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:20,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:01:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 17. [2018-12-03 17:01:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:01:21,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 17:01:21,157 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 17:01:21,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:21,157 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 17:01:21,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 17:01:21,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:21,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:21,158 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:01:21,158 INFO L423 AbstractCegarLoop]: === Iteration 472 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:21,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:21,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1888989696, now seen corresponding path program 456 times [2018-12-03 17:01:21,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:21,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:21,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:21,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:21,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:21,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:21,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,232 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 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 472 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:21,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:21,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:21,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:21,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:21,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:21,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:21,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:21,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:21,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:21,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:21,376 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 17:01:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:22,590 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:01:22,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:22,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:22,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:22,591 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:01:22,591 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:01:22,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:22,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:01:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 17:01:23,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:23,260 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:23,260 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:23,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:23,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:23,260 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:23,261 INFO L423 AbstractCegarLoop]: === Iteration 473 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:23,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:23,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1888991618, now seen corresponding path program 457 times [2018-12-03 17:01:23,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:23,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:23,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:23,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:23,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:23,333 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:23,333 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:23,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:23,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:23,334 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 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 473 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:23,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:23,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:23,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:23,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:23,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:23,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:23,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:23,494 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:23,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:23,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:23,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:23,494 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:24,674 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:01:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:24,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:24,674 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:01:24,674 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:01:24,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:01:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 17:01:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:01:25,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:01:25,323 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:01:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:25,324 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:01:25,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:25,324 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:01:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:25,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:25,324 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:25,324 INFO L423 AbstractCegarLoop]: === Iteration 474 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:25,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:25,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1889049278, now seen corresponding path program 458 times [2018-12-03 17:01:25,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:25,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:25,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:25,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:25,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:25,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:25,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:25,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:25,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:25,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:25,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:25,602 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 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 474 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:25,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:25,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:25,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:25,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:25,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:25,619 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:25,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:25,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:25,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:25,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:25,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:25,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:25,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:25,734 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:01:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:26,953 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:01:26,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:26,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:26,954 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:01:26,954 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:01:26,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 17:01:26,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:01:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 17:01:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:27,615 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:27,615 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:27,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:27,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:27,615 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:01:27,615 INFO L423 AbstractCegarLoop]: === Iteration 475 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:27,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:27,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1889051200, now seen corresponding path program 459 times [2018-12-03 17:01:27,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:27,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:27,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:27,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:27,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:27,682 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:27,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:27,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:27,683 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:27,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:27,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:27,683 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 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 475 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:27,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:27,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:27,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:27,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:27,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:27,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:27,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:27,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:27,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:27,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:27,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:27,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:27,836 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:29,020 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:01:29,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:29,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:29,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:29,020 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:01:29,020 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:01:29,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:29,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:01:29,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-12-03 17:01:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:01:29,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:01:29,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:01:29,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:29,647 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:01:29,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:01:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:29,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:29,647 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:29,648 INFO L423 AbstractCegarLoop]: === Iteration 476 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:29,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:29,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1890836738, now seen corresponding path program 460 times [2018-12-03 17:01:29,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:29,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:29,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:29,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:29,648 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:29,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:29,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:29,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:29,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:29,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:29,739 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 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 476 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:29,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:29,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:29,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:29,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:30,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:30,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:30,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:30,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:30,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:30,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:30,058 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:01:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:31,157 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:01:31,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:31,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:31,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:31,158 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:01:31,158 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:01:31,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 17:01:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:01:31,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-12-03 17:01:31,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:31,842 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:31,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:31,842 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:31,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:31,842 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:31,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:31,842 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:01:31,842 INFO L423 AbstractCegarLoop]: === Iteration 477 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:31,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:31,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1890838660, now seen corresponding path program 461 times [2018-12-03 17:01:31,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:31,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:31,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:31,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:31,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:31,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:31,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:31,912 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:31,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:31,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:31,912 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 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 477 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:31,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:31,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:31,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:31,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:31,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:31,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:32,044 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:32,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:32,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:32,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:32,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:32,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:32,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:32,064 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:33,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:33,216 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:01:33,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:33,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:33,216 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:01:33,217 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:01:33,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:33,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:01:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 17:01:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:01:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:01:33,925 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:01:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:33,925 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:01:33,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:01:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:33,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:33,925 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:01:33,926 INFO L423 AbstractCegarLoop]: === Iteration 478 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:33,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:33,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1890896320, now seen corresponding path program 462 times [2018-12-03 17:01:33,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:33,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:33,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:33,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:33,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:33,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:33,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:33,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 17:01:33,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:33,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 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 478 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:34,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:34,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:34,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:34,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:34,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:34,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:34,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:34,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:34,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:34,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:34,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:34,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:34,153 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:01:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:35,247 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 17:01:35,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:35,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:35,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:35,248 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:01:35,248 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:01:35,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:35,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:01:35,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-12-03 17:01:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:35,925 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:35,926 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:35,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:35,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:35,926 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 17:01:35,926 INFO L423 AbstractCegarLoop]: === Iteration 479 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:35,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:35,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1890898242, now seen corresponding path program 463 times [2018-12-03 17:01:35,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:35,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:35,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:35,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:36,036 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:36,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:36,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:36,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:36,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 17:01:36,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:36,037 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 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 479 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:36,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:36,045 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:36,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:36,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:36,148 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:36,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:36,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:36,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:36,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:36,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:36,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:36,169 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:37,218 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 17:01:37,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:37,218 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:37,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:37,219 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:01:37,219 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:01:37,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:01:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-12-03 17:01:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:01:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 17:01:37,696 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 11 [2018-12-03 17:01:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:37,696 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 17:01:37,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 17:01:37,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:37,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:37,696 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:37,696 INFO L423 AbstractCegarLoop]: === Iteration 480 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:37,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:37,696 INFO L82 PathProgramCache]: Analyzing trace with hash -752622594, now seen corresponding path program 464 times [2018-12-03 17:01:37,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:37,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:37,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:37,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:37,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:37,784 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:37,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:37,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:37,785 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 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 480 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:37,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:37,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:37,807 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:37,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:37,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:37,809 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:37,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:37,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:37,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:37,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:37,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:37,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:37,941 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 11 states. [2018-12-03 17:01:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:39,171 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:01:39,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:39,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:39,171 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:01:39,171 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:01:39,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:01:39,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 17:01:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:39,891 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:39,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:39,892 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:39,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:39,892 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:39,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:39,892 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:01:39,892 INFO L423 AbstractCegarLoop]: === Iteration 481 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:39,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:39,892 INFO L82 PathProgramCache]: Analyzing trace with hash -752620672, now seen corresponding path program 465 times [2018-12-03 17:01:39,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:39,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:39,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:39,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:39,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:39,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:39,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:39,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:39,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:39,978 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 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 481 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:39,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:39,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:39,992 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:39,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:39,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:39,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:40,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:40,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:40,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:40,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:40,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:40,228 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:41,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:41,375 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:01:41,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:41,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:41,376 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:01:41,376 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:01:41,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:41,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:01:42,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 17:01:42,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:01:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:01:42,056 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:01:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:42,056 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:01:42,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:01:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:42,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:42,056 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:01:42,056 INFO L423 AbstractCegarLoop]: === Iteration 482 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:42,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:42,057 INFO L82 PathProgramCache]: Analyzing trace with hash -752563012, now seen corresponding path program 466 times [2018-12-03 17:01:42,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:42,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:42,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:42,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:42,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:42,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:42,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:42,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:42,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:42,129 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 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 482 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:42,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:42,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:42,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:42,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:42,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:42,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:42,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:42,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:42,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:42,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:42,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:42,278 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:01:43,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:43,494 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:01:43,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:43,494 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:43,494 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:01:43,494 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:01:43,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:01:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 17:01:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:44,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:44,185 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:44,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:44,185 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:44,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:44,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:44,186 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:44,186 INFO L423 AbstractCegarLoop]: === Iteration 483 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:44,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash -752561090, now seen corresponding path program 467 times [2018-12-03 17:01:44,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:44,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:44,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:44,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:44,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:44,270 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:44,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:44,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:44,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:44,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:44,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:44,271 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 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 483 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:44,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:44,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:44,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:44,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:44,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:44,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:44,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:44,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:44,426 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:44,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:44,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:44,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:44,426 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:45,584 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:01:45,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:45,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:45,584 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:01:45,584 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:01:45,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:01:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 17:01:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:01:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:01:46,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:01:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:46,248 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:01:46,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:01:46,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:46,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:46,248 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:01:46,248 INFO L423 AbstractCegarLoop]: === Iteration 484 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:46,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:46,248 INFO L82 PathProgramCache]: Analyzing trace with hash -750775552, now seen corresponding path program 468 times [2018-12-03 17:01:46,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:46,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:46,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:46,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:46,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:46,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:46,320 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:46,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:46,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:46,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:46,320 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 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 484 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:46,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:46,328 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:46,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:46,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:46,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:46,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:46,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:46,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:46,472 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:46,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:46,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:46,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:46,472 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:01:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:47,588 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 17:01:47,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:47,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:47,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:47,589 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:01:47,589 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:01:47,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:47,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:01:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-12-03 17:01:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:48,295 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:48,295 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:48,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:48,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:48,296 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:48,296 INFO L423 AbstractCegarLoop]: === Iteration 485 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:48,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:48,296 INFO L82 PathProgramCache]: Analyzing trace with hash -750773630, now seen corresponding path program 469 times [2018-12-03 17:01:48,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:48,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:48,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:48,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:48,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:48,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:48,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:48,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 17:01:48,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:48,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 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 485 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:48,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:48,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:48,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:48,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:48,491 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:48,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:48,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:48,511 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:48,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:48,512 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:49,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:49,651 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 17:01:49,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:49,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:49,651 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:01:49,651 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:01:49,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:01:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 17:01:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:01:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:01:50,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:01:50,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:50,343 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:01:50,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:01:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:50,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:50,343 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:50,343 INFO L423 AbstractCegarLoop]: === Iteration 486 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:50,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:50,344 INFO L82 PathProgramCache]: Analyzing trace with hash -750715970, now seen corresponding path program 470 times [2018-12-03 17:01:50,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:50,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:50,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:50,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:50,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:50,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:50,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:50,426 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:50,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:50,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:50,427 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 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 486 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:50,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:50,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:50,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:50,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:50,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:50,445 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:50,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:50,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:50,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:50,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:50,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:50,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:50,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:50,591 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:01:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:51,667 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 17:01:51,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:51,667 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:51,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:51,668 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:01:51,668 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:01:51,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:01:52,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-03 17:01:52,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:52,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:52,366 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:52,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:52,367 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:52,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:52,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:52,367 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:01:52,367 INFO L423 AbstractCegarLoop]: === Iteration 487 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:52,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:52,367 INFO L82 PathProgramCache]: Analyzing trace with hash -750714048, now seen corresponding path program 471 times [2018-12-03 17:01:52,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:52,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:52,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:52,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:52,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:52,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:52,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:52,433 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:52,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:52,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:52,433 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 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 487 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:52,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:52,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:52,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:52,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:52,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:52,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:52,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:52,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:52,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:52,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:52,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:52,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:52,576 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:53,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:53,616 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 17:01:53,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:53,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:53,616 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:01:53,616 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:01:53,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:53,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:01:54,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 17. [2018-12-03 17:01:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:01:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 17:01:54,220 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 17:01:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:54,220 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 17:01:54,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 17:01:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:54,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:54,221 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:01:54,221 INFO L423 AbstractCegarLoop]: === Iteration 488 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:54,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:54,221 INFO L82 PathProgramCache]: Analyzing trace with hash -695364292, now seen corresponding path program 472 times [2018-12-03 17:01:54,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:54,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:54,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:54,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:54,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:54,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:54,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:54,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:54,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:54,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:54,341 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 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 488 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:54,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:54,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:54,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:54,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:54,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:54,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:54,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:54,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:54,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:54,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:54,494 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 17:01:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:55,689 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:01:55,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:55,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:55,689 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:01:55,689 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:01:55,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:01:56,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 17:01:56,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:01:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:01:56,403 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:01:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:56,403 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:01:56,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:01:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:56,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:56,404 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:56,404 INFO L423 AbstractCegarLoop]: === Iteration 489 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:56,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash -695362370, now seen corresponding path program 473 times [2018-12-03 17:01:56,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:56,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:56,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:56,405 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:56,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:56,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:56,467 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:56,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:56,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:56,467 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 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 489 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:56,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:56,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:56,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:01:56,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:56,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:56,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:56,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:56,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:56,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:56,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:56,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:56,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:56,613 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:01:57,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:57,756 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:01:57,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:57,756 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:57,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:57,756 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:01:57,756 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:01:57,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:57,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:01:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2018-12-03 17:01:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:01:58,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:01:58,442 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:01:58,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:58,442 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:01:58,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:01:58,443 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:01:58,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:01:58,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:58,443 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:01:58,443 INFO L423 AbstractCegarLoop]: === Iteration 490 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:58,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:58,443 INFO L82 PathProgramCache]: Analyzing trace with hash -695304710, now seen corresponding path program 474 times [2018-12-03 17:01:58,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:58,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:58,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:58,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:58,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:58,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:58,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:58,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:58,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:58,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:58,510 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 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 490 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:58,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:58,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:58,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:58,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:58,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:58,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:58,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:58,632 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:58,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:58,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:01:58,650 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:58,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:01:58,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:01:58,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:58,651 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:01:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:59,859 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:01:59,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:01:59,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:01:59,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:59,860 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:01:59,860 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:01:59,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:01:59,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:02:00,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 17:02:00,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:00,569 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:00,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:00,569 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:00,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:00,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:00,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:00,570 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:02:00,570 INFO L423 AbstractCegarLoop]: === Iteration 491 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:00,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:00,570 INFO L82 PathProgramCache]: Analyzing trace with hash -695302788, now seen corresponding path program 475 times [2018-12-03 17:02:00,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:00,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:00,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:00,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:00,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:00,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:00,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:00,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:00,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:00,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:00,646 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 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 491 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:00,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:00,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:00,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:00,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:00,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:00,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:00,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:00,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:00,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:00,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:00,830 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:02,020 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:02:02,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:02,020 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:02,020 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:02:02,020 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:02:02,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:02:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-12-03 17:02:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:02:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:02:02,675 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:02:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:02,676 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:02:02,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:02:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:02,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:02,676 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:02:02,676 INFO L423 AbstractCegarLoop]: === Iteration 492 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:02,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash -693517250, now seen corresponding path program 476 times [2018-12-03 17:02:02,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:02,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:02,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:02,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:02,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:02,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:02,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:02,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:02,744 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 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 492 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:02,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:02,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:02,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:02:02,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:02,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:02,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:02,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:02,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:02,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:02,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:02,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:02,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:02,924 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:02:04,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:04,035 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 17:02:04,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:04,035 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:04,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:04,036 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:02:04,036 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:02:04,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:04,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:02:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2018-12-03 17:02:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:04,742 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:04,742 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:04,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:04,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:04,743 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:02:04,743 INFO L423 AbstractCegarLoop]: === Iteration 493 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:04,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:04,743 INFO L82 PathProgramCache]: Analyzing trace with hash -693515328, now seen corresponding path program 477 times [2018-12-03 17:02:04,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:04,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:04,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:04,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:04,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:04,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:04,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:04,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:04,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:04,813 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 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 493 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:04,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:04,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:04,826 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:04,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:04,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:04,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:04,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:04,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:04,949 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:04,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:04,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:04,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:04,949 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:06,047 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 17:02:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:06,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:06,048 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:02:06,048 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:02:06,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:02:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2018-12-03 17:02:06,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:02:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:02:06,847 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:02:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:06,847 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:02:06,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:02:06,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:06,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:06,847 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:02:06,848 INFO L423 AbstractCegarLoop]: === Iteration 494 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:06,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:06,848 INFO L82 PathProgramCache]: Analyzing trace with hash -693457668, now seen corresponding path program 478 times [2018-12-03 17:02:06,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:06,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:06,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:06,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:06,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:06,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:06,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:06,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:06,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:06,942 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 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 494 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:06,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:06,951 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:06,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:06,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:07,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:07,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:07,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:07,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:07,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:07,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:07,109 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:02:08,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:08,179 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 17:02:08,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:08,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:08,179 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:02:08,179 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:02:08,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:08,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:02:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-03 17:02:08,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:08,882 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:08,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:08,883 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:08,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:08,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:08,883 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 17:02:08,883 INFO L423 AbstractCegarLoop]: === Iteration 495 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:08,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash -693455746, now seen corresponding path program 479 times [2018-12-03 17:02:08,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:08,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:08,884 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:08,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:08,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:08,951 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:08,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:08,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:08,951 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 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 495 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:08,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:08,960 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:08,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:02:08,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:08,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:08,967 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:08,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:09,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:09,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:09,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:09,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:09,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:09,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:09,092 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:10,121 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 17:02:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:10,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:10,122 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:02:10,122 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:02:10,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:10,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:02:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-12-03 17:02:10,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:02:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 17:02:10,674 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 11 [2018-12-03 17:02:10,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:10,674 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 17:02:10,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 17:02:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:10,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:10,674 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-12-03 17:02:10,674 INFO L423 AbstractCegarLoop]: === Iteration 496 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:10,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:10,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1022384768, now seen corresponding path program 480 times [2018-12-03 17:02:10,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:10,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:10,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:10,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:10,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:10,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:10,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:10,761 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:10,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:10,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:10,761 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 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 496 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:10,772 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:10,772 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:10,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:10,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:10,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:10,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:10,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:11,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:11,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:11,161 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:11,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:11,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:11,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:11,162 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 11 states. [2018-12-03 17:02:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:12,214 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 17:02:12,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:12,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:12,215 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:02:12,215 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:02:12,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:02:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-03 17:02:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:12,940 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:12,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:12,940 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:12,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:12,940 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:12,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:12,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:12,940 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:02:12,941 INFO L423 AbstractCegarLoop]: === Iteration 497 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:12,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1022386690, now seen corresponding path program 481 times [2018-12-03 17:02:12,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:12,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:12,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:12,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:12,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:13,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:13,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:13,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:13,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:13,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:13,007 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 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 497 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:13,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:13,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:13,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:13,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:13,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:13,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:13,170 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:13,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:13,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:13,170 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:14,243 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 17:02:14,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:14,243 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:14,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:14,244 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:02:14,244 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:02:14,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:02:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 17:02:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:02:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:02:14,956 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:02:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:14,956 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:02:14,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:02:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:14,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:14,957 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:02:14,957 INFO L423 AbstractCegarLoop]: === Iteration 498 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:14,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1022444350, now seen corresponding path program 482 times [2018-12-03 17:02:14,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:14,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:14,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:14,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:15,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:15,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:15,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:15,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:15,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:15,022 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 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 498 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:15,031 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:15,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:15,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:02:15,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:15,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:15,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:15,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:15,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:15,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:15,163 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:15,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:15,164 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:02:16,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:16,271 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 17:02:16,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:16,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:16,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:16,272 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:02:16,272 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:02:16,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:02:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-12-03 17:02:16,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:16,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:16,986 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:16,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:16,986 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:16,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:16,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:16,986 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:02:16,986 INFO L423 AbstractCegarLoop]: === Iteration 499 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:16,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:16,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1022446272, now seen corresponding path program 483 times [2018-12-03 17:02:16,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:16,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:16,987 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:17,054 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:17,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:17,054 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:17,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:17,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:17,054 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 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 499 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:17,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:17,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:17,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:17,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:17,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:17,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:17,197 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:17,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:17,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:17,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:17,198 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:18,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:18,190 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 17:02:18,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:18,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:18,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:18,191 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:02:18,191 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:02:18,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:18,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:02:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-12-03 17:02:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:02:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:02:18,878 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:02:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:18,878 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:02:18,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:02:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:18,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:18,879 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:02:18,879 INFO L423 AbstractCegarLoop]: === Iteration 500 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:18,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1024231810, now seen corresponding path program 484 times [2018-12-03 17:02:18,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:18,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:18,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:18,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:18,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:18,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:18,944 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:18,944 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:18,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:18,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:18,944 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 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 500 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:18,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:18,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:18,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:18,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:19,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:19,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:19,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:19,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:19,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:19,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:19,102 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:02:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:20,192 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 17:02:20,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:20,192 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:20,193 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:02:20,193 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:02:20,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:02:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-12-03 17:02:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:20,909 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:20,909 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:20,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:20,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:20,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:20,910 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:02:20,910 INFO L423 AbstractCegarLoop]: === Iteration 501 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:20,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:20,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1024233732, now seen corresponding path program 485 times [2018-12-03 17:02:20,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:20,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:20,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:20,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:20,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:20,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:20,992 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:20,992 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:20,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:20,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:20,992 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 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 501 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:21,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:21,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:21,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:02:21,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:21,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:21,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:21,280 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:21,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:21,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:21,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:21,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:21,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:21,300 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:22,395 INFO L93 Difference]: Finished difference Result 29 states and 53 transitions. [2018-12-03 17:02:22,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:22,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:22,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:22,395 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:02:22,395 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:02:22,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 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 17:02:22,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:02:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2018-12-03 17:02:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:02:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:02:23,099 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:02:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:23,099 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:02:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:02:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:23,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:23,099 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:02:23,099 INFO L423 AbstractCegarLoop]: === Iteration 502 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:23,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1024291392, now seen corresponding path program 486 times [2018-12-03 17:02:23,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:23,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:23,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:23,166 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:23,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:23,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:23,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:23,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:23,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:23,167 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 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 502 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:23,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:23,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:23,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:23,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:23,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:23,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:23,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:23,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:23,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:23,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:23,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:23,326 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:02:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:24,351 INFO L93 Difference]: Finished difference Result 28 states and 51 transitions. [2018-12-03 17:02:24,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:24,351 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:24,352 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:02:24,352 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:02:24,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:24,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:02:25,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-12-03 17:02:25,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:25,081 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:25,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:25,082 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:25,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:25,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:25,082 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 17:02:25,082 INFO L423 AbstractCegarLoop]: === Iteration 503 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:25,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:25,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1024293314, now seen corresponding path program 487 times [2018-12-03 17:02:25,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:25,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:25,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:25,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:25,150 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:25,150 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:25,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:25,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:25,150 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 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 503 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:25,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:25,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:25,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:25,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:25,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:25,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:25,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:25,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:25,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:25,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:25,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:25,320 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:26,304 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 17:02:26,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:26,304 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:26,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:26,305 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:02:26,305 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:02:26,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:02:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2018-12-03 17:02:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:02:26,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 17:02:26,938 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 11 [2018-12-03 17:02:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:26,938 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 17:02:26,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 17:02:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:26,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:26,938 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 1, 1, 1] [2018-12-03 17:02:26,938 INFO L423 AbstractCegarLoop]: === Iteration 504 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:26,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:26,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1079643070, now seen corresponding path program 488 times [2018-12-03 17:02:26,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:26,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:26,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:26,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:27,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:27,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:27,009 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:27,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:27,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:27,009 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 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 504 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:27,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:27,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:27,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:02:27,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:27,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:27,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:27,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:27,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:27,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:27,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:27,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:27,161 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 11 states. [2018-12-03 17:02:28,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:28,130 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 17:02:28,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:28,130 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:28,130 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:02:28,130 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:02:28,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:28,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:02:28,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-12-03 17:02:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:28,852 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:28,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:28,852 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:28,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:28,852 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:28,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:28,852 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:02:28,853 INFO L423 AbstractCegarLoop]: === Iteration 505 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:28,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:28,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1079644992, now seen corresponding path program 489 times [2018-12-03 17:02:28,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:28,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:28,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:28,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:28,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:28,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:28,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:28,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:28,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:28,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:28,919 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 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 505 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:28,928 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:28,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:28,932 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:28,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:28,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:28,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:29,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:29,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:29,055 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:29,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:29,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:29,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:29,056 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:30,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:30,008 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 17:02:30,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:30,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:30,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:30,009 INFO L225 Difference]: With dead ends: 26 [2018-12-03 17:02:30,009 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 17:02:30,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 17:02:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2018-12-03 17:02:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:02:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:02:30,733 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:02:30,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:30,733 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:02:30,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:02:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:30,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:30,733 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:02:30,734 INFO L423 AbstractCegarLoop]: === Iteration 506 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:30,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:30,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1079702652, now seen corresponding path program 490 times [2018-12-03 17:02:30,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:30,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:30,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:30,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:30,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:30,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:30,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:30,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:30,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:30,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:30,801 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 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 506 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:30,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:30,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:30,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:30,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:30,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:30,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:30,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:30,976 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:30,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:30,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:30,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:30,976 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:02:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:31,919 INFO L93 Difference]: Finished difference Result 27 states and 49 transitions. [2018-12-03 17:02:31,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:31,919 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:31,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:31,920 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:02:31,920 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:02:31,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:02:32,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-12-03 17:02:32,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:32,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:32,649 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:32,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:32,649 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:32,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:32,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:32,649 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 17:02:32,650 INFO L423 AbstractCegarLoop]: === Iteration 507 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:32,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:32,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1079704574, now seen corresponding path program 491 times [2018-12-03 17:02:32,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:32,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:32,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:32,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:32,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:32,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:32,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:32,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:32,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:32,719 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 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 507 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:32,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:32,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:32,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:02:32,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:32,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:32,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:32,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:32,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:32,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:32,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:32,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:32,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:32,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:32,861 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:33,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:33,812 INFO L93 Difference]: Finished difference Result 26 states and 47 transitions. [2018-12-03 17:02:33,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:33,812 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:33,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:33,813 INFO L225 Difference]: With dead ends: 26 [2018-12-03 17:02:33,813 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 17:02:33,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 17:02:34,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2018-12-03 17:02:34,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:02:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:02:34,486 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 11 [2018-12-03 17:02:34,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:34,486 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:02:34,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:34,486 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:02:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:34,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:34,486 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 1, 1, 1] [2018-12-03 17:02:34,486 INFO L423 AbstractCegarLoop]: === Iteration 508 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:34,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:34,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1081490112, now seen corresponding path program 492 times [2018-12-03 17:02:34,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:34,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:34,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:34,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:34,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:34,553 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:34,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:34,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:34,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:34,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:34,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:34,554 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 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 508 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:34,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:34,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:34,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:34,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:34,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:34,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:34,685 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:34,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:34,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:34,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:34,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:34,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:34,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:34,704 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 11 states. [2018-12-03 17:02:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:35,580 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 17:02:35,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:35,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:35,580 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:02:35,580 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:02:35,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:02:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-12-03 17:02:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:36,313 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:36,313 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:36,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:36,313 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:36,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:36,313 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 17:02:36,314 INFO L423 AbstractCegarLoop]: === Iteration 509 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:36,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:36,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1081492034, now seen corresponding path program 493 times [2018-12-03 17:02:36,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:36,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:36,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:36,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:36,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:36,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:36,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:36,456 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:36,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:36,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:36,456 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 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 509 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:36,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:36,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:36,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:36,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:36,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:36,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:36,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:36,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:36,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:36,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:36,607 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:37,510 INFO L93 Difference]: Finished difference Result 25 states and 45 transitions. [2018-12-03 17:02:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:37,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:37,511 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:02:37,511 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:02:37,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:02:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-12-03 17:02:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:02:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:02:38,213 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 11 [2018-12-03 17:02:38,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:38,214 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:02:38,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:38,214 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:02:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:38,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:38,214 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2018-12-03 17:02:38,214 INFO L423 AbstractCegarLoop]: === Iteration 510 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:38,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1081549694, now seen corresponding path program 494 times [2018-12-03 17:02:38,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:38,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:38,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:38,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:38,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:38,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:38,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:38,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:38,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:38,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:38,285 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 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 510 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:38,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:38,294 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:38,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:02:38,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:38,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:38,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:38,422 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:38,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:38,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:38,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:38,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:38,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:38,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:38,441 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 11 states. [2018-12-03 17:02:39,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:39,303 INFO L93 Difference]: Finished difference Result 24 states and 43 transitions. [2018-12-03 17:02:39,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:39,303 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:39,303 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:02:39,303 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 17:02:39,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:39,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 17:02:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-12-03 17:02:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:40,061 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 11 [2018-12-03 17:02:40,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:40,062 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:40,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:40,062 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:40,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:02:40,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:40,062 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 17:02:40,062 INFO L423 AbstractCegarLoop]: === Iteration 511 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:40,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1081551616, now seen corresponding path program 8 times [2018-12-03 17:02:40,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:40,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:40,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:40,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:40,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:40,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:40,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:40,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:40,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:40,131 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 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 511 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:40,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:40,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:40,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:02:40,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:40,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:40,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:40,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:40,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:02:40,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:40,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:02:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:02:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:40,280 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 11 states. [2018-12-03 17:02:41,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:41,105 INFO L93 Difference]: Finished difference Result 23 states and 41 transitions. [2018-12-03 17:02:41,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:02:41,105 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:02:41,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:41,105 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:02:41,105 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:02:41,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:02:41,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:02:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2018-12-03 17:02:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:02:41,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 23 transitions. [2018-12-03 17:02:41,549 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 23 transitions. Word has length 11 [2018-12-03 17:02:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:41,549 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 23 transitions. [2018-12-03 17:02:41,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:02:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 23 transitions. [2018-12-03 17:02:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:02:41,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:41,550 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 17:02:41,550 INFO L423 AbstractCegarLoop]: === Iteration 512 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:41,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1450400680, now seen corresponding path program 9 times [2018-12-03 17:02:41,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:41,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:41,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:41,661 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 17:02:41,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:41,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:41,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:41,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:41,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:41,662 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 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 512 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:41,676 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:41,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:41,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:41,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:41,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:41,685 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 17:02:41,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:41,841 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 17:02:41,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:41,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:02:41,861 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:41,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:02:41,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:02:41,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:41,862 INFO L87 Difference]: Start difference. First operand 13 states and 23 transitions. Second operand 12 states. [2018-12-03 17:02:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:43,763 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 17:02:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:02:43,763 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:02:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:43,763 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:02:43,763 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:02:43,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:02:44,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 17:02:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:02:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:02:44,632 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:02:44,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:44,633 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:02:44,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:02:44,633 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:02:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:02:44,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:44,633 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 17:02:44,633 INFO L423 AbstractCegarLoop]: === Iteration 513 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:44,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:44,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1450402602, now seen corresponding path program 495 times [2018-12-03 17:02:44,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:44,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:44,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:44,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:44,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:44,710 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 17:02:44,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:44,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:44,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:44,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:44,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:44,714 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 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 513 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:44,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:44,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:44,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:44,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:44,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:44,730 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 17:02:44,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:44,879 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 17:02:44,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:44,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:02:44,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:44,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:02:44,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:02:44,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:44,898 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:02:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:46,717 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 17:02:46,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:02:46,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:02:46,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:46,718 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:02:46,718 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:02:46,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:02:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 17:02:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:47,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:02:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:47,583 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:47,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:02:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:47,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:02:47,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:47,583 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 17:02:47,583 INFO L423 AbstractCegarLoop]: === Iteration 514 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:47,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:47,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1450460262, now seen corresponding path program 496 times [2018-12-03 17:02:47,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:47,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:47,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:47,584 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:47,660 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 17:02:47,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:47,660 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:47,660 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:47,660 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:47,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:47,660 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 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 514 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:47,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:47,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:47,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:47,677 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 17:02:47,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:47,895 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 17:02:47,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:47,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:02:47,915 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:47,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:02:47,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:02:47,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:47,916 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:02:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:49,793 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 17:02:49,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:02:49,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:02:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:49,794 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:02:49,794 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:02:49,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:02:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 17:02:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:02:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:02:50,689 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:02:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:50,690 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:02:50,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:02:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:02:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:02:50,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:50,690 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:02:50,690 INFO L423 AbstractCegarLoop]: === Iteration 515 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:50,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:50,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1450462184, now seen corresponding path program 497 times [2018-12-03 17:02:50,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:50,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:50,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:50,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:50,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:50,764 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 17:02:50,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:50,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:50,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:50,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:50,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:50,765 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 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 515 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:50,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:50,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:50,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:02:50,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:50,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:50,781 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 17:02:50,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:50,925 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 17:02:50,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:50,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:02:50,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:50,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:02:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:02:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:50,945 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:02:52,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:52,802 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 17:02:52,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:02:52,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:02:52,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:52,803 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:02:52,803 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:02:52,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:52,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:02:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-12-03 17:02:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:02:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:02:53,620 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:02:53,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:53,620 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:02:53,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:02:53,620 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:02:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:02:53,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:53,620 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 17:02:53,620 INFO L423 AbstractCegarLoop]: === Iteration 516 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:53,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:53,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1452247722, now seen corresponding path program 498 times [2018-12-03 17:02:53,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:53,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:53,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:53,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:53,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:53,696 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 17:02:53,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:53,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:53,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:53,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:53,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:53,698 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 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 516 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:53,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:53,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:53,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:53,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:53,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:53,716 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 17:02:53,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:53,862 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 17:02:53,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:53,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:02:53,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:53,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:02:53,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:02:53,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:53,881 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:02:55,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:55,647 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 17:02:55,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:02:55,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:02:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:55,647 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:02:55,647 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:02:55,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:55,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:02:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2018-12-03 17:02:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:02:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:02:56,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:02:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:56,549 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:02:56,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:02:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:02:56,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:02:56,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:56,550 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:02:56,550 INFO L423 AbstractCegarLoop]: === Iteration 517 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:56,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:56,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1452249644, now seen corresponding path program 499 times [2018-12-03 17:02:56,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:56,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:56,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:56,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:56,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:56,641 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 17:02:56,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:56,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:56,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:56,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:56,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:56,642 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 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 517 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:56,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:56,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:56,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:56,658 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 17:02:56,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:57,010 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 17:02:57,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:57,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:02:57,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:57,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:02:57,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:02:57,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:57,028 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:02:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:58,825 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 17:02:58,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:02:58,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:02:58,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:58,825 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:02:58,825 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:02:58,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:58,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:02:59,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-03 17:02:59,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:02:59,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:02:59,683 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:02:59,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:59,684 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:02:59,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:02:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:02:59,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:02:59,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:59,684 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:02:59,684 INFO L423 AbstractCegarLoop]: === Iteration 518 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:59,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:59,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1452307304, now seen corresponding path program 500 times [2018-12-03 17:02:59,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:59,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:59,762 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 17:02:59,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:59,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:59,762 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:59,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:59,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:59,762 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 518 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 518 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:59,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:59,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:59,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:02:59,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:59,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:59,782 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 17:02:59,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:59,925 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 17:02:59,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:59,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:02:59,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:59,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:02:59,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:02:59,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:02:59,946 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:03:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:01,666 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:03:01,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:01,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:01,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:01,667 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:03:01,667 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:03:01,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:03:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 17:03:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:02,550 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:02,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:02,550 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:02,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:02,550 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:02,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:02,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:02,550 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:03:02,550 INFO L423 AbstractCegarLoop]: === Iteration 519 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:02,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:02,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1452309226, now seen corresponding path program 501 times [2018-12-03 17:03:02,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:02,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:02,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:02,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:02,625 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 17:03:02,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:02,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:02,625 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:02,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:02,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:02,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 519 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 519 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:02,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:02,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:02,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:02,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:02,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:02,641 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 17:03:02,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:02,775 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 17:03:02,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:02,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:02,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:02,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:02,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:02,795 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:04,473 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:03:04,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:04,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:04,474 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:03:04,474 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:03:04,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:04,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:03:05,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2018-12-03 17:03:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:03:05,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:03:05,239 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 17:03:05,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:05,239 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:03:05,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:05,239 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:03:05,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:05,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:05,239 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 17:03:05,239 INFO L423 AbstractCegarLoop]: === Iteration 520 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:05,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:05,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1507658982, now seen corresponding path program 502 times [2018-12-03 17:03:05,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:05,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:05,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:05,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:05,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:05,314 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 17:03:05,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:05,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:05,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:05,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:05,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:05,315 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 520 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 520 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:05,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:05,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:05,332 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 17:03:05,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:05,466 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 17:03:05,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:05,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:05,486 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:05,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:05,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:05,486 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 17:03:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:07,401 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 17:03:07,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:07,401 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:07,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:07,402 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:03:07,402 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:03:07,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:03:08,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 17:03:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:08,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:08,274 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:08,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:08,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:08,275 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:03:08,275 INFO L423 AbstractCegarLoop]: === Iteration 521 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:08,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:08,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1507660904, now seen corresponding path program 503 times [2018-12-03 17:03:08,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:08,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:08,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:08,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:08,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:08,350 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 17:03:08,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:08,350 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:08,351 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:08,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:08,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:08,351 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 521 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 521 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:08,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:08,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:08,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:03:08,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:08,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:08,368 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 17:03:08,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:08,539 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 17:03:08,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:08,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:08,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:08,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:08,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:08,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:08,560 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:10,364 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 17:03:10,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:10,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:10,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:10,365 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:03:10,365 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:03:10,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:03:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 17:03:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:03:11,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:03:11,291 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:03:11,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:11,291 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:03:11,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:11,291 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:03:11,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:11,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:11,291 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:03:11,291 INFO L423 AbstractCegarLoop]: === Iteration 522 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:11,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:11,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1507718564, now seen corresponding path program 504 times [2018-12-03 17:03:11,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:11,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:11,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:11,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:11,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:11,377 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 17:03:11,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:11,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:11,377 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:11,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:11,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:11,377 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 522 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 522 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:11,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:11,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:11,391 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:11,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:11,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:11,393 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 17:03:11,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:11,517 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 17:03:11,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:11,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:11,536 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:11,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:11,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:11,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:11,537 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:03:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:13,453 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 17:03:13,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:13,453 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:13,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:13,454 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:03:13,454 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:03:13,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:13,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:03:14,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 17:03:14,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:14,339 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:14,339 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:14,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:14,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:14,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:14,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:14,339 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:03:14,340 INFO L423 AbstractCegarLoop]: === Iteration 523 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:14,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:14,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1507720486, now seen corresponding path program 505 times [2018-12-03 17:03:14,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:14,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:14,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:14,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:14,413 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 17:03:14,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:14,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:14,413 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:14,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:14,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:14,414 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 523 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 523 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:14,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:14,423 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:14,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:14,433 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 17:03:14,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:14,572 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 17:03:14,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:14,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:14,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:14,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:14,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:14,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:14,591 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:16,430 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 17:03:16,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:16,430 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:16,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:16,430 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:03:16,430 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:03:16,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:03:17,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-12-03 17:03:17,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:03:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:03:17,284 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:03:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:17,284 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:03:17,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:03:17,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:17,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:17,285 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:03:17,285 INFO L423 AbstractCegarLoop]: === Iteration 524 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:17,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:17,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1509506024, now seen corresponding path program 506 times [2018-12-03 17:03:17,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:17,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:17,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:17,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:17,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:17,474 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 17:03:17,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:17,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:17,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:17,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 17:03:17,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:17,475 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 524 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 524 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:17,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:17,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:17,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:03:17,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:17,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:17,496 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 17:03:17,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:17,631 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 17:03:17,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:17,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:17,649 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:17,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:17,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:17,650 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:03:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:19,463 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 17:03:19,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:19,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:19,464 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:03:19,464 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:03:19,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 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 17:03:19,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:03:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2018-12-03 17:03:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:20,344 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:20,344 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:20,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:20,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:20,344 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:03:20,344 INFO L423 AbstractCegarLoop]: === Iteration 525 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:20,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:20,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1509507946, now seen corresponding path program 507 times [2018-12-03 17:03:20,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:20,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:20,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:20,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:20,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:20,424 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 17:03:20,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:20,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:20,424 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:20,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:20,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:20,424 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 525 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 525 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:20,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:20,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:20,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:20,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:20,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:20,440 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 17:03:20,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:20,579 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 17:03:20,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:20,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:20,598 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:20,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:20,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:20,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:20,598 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:22,388 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 17:03:22,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:22,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:22,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:22,389 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:03:22,389 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:03:22,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:22,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:03:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-03 17:03:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:03:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:03:23,291 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:03:23,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:23,291 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:03:23,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:03:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:23,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:23,291 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:03:23,292 INFO L423 AbstractCegarLoop]: === Iteration 526 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:23,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1509565606, now seen corresponding path program 508 times [2018-12-03 17:03:23,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:23,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:23,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:23,369 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 17:03:23,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:23,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:23,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:23,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:23,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:23,370 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 526 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 526 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:23,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:23,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:23,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:23,387 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 17:03:23,387 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:23,527 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 17:03:23,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:23,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:23,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:23,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:23,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:23,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:23,545 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:03:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:25,253 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:03:25,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:25,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:25,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:25,253 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:03:25,253 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:03:25,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:03:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 17:03:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:26,133 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:26,133 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:26,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:26,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:26,133 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:03:26,134 INFO L423 AbstractCegarLoop]: === Iteration 527 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:26,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:26,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1509567528, now seen corresponding path program 509 times [2018-12-03 17:03:26,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:26,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:26,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:26,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:26,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:26,207 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 17:03:26,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:26,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:26,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:26,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:26,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:26,207 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 527 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 527 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:26,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:26,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:26,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:03:26,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:26,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:26,229 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 17:03:26,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:26,373 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 17:03:26,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:26,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:26,392 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:26,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:26,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:26,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:26,392 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:28,057 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:03:28,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:28,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:28,058 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:03:28,058 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:03:28,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:28,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:03:28,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 17. [2018-12-03 17:03:28,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:03:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 17:03:28,757 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 12 [2018-12-03 17:03:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:28,757 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 17:03:28,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 17:03:28,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:28,757 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:28,757 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 17:03:28,757 INFO L423 AbstractCegarLoop]: === Iteration 528 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:28,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:28,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1069559254, now seen corresponding path program 510 times [2018-12-03 17:03:28,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:28,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:28,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:28,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:28,758 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:28,835 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 17:03:28,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:28,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:28,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:28,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 17:03:28,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:28,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 528 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 528 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:28,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:28,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:28,851 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:28,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:28,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:28,854 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 17:03:28,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:28,997 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 17:03:29,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:29,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:29,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:29,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:29,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:29,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:29,016 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 12 states. [2018-12-03 17:03:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:30,760 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:03:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:30,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:30,761 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:03:30,761 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:03:30,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:30,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:03:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 17:03:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:31,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:31,662 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:31,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:31,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:31,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:31,662 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:03:31,662 INFO L423 AbstractCegarLoop]: === Iteration 529 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:31,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:31,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1069557332, now seen corresponding path program 511 times [2018-12-03 17:03:31,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:31,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:31,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:31,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:31,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:31,735 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 17:03:31,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:31,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:31,735 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:31,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:31,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:31,736 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 529 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 529 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:31,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:31,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:31,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:31,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:31,753 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 17:03:31,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:31,887 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 17:03:31,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:31,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:31,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:31,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:31,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:31,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:31,908 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:33,669 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:03:33,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:33,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:33,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:33,669 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:03:33,669 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:03:33,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:33,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:03:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 17:03:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:03:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:03:34,542 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:03:34,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:34,542 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:03:34,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:34,542 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:03:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:34,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:34,543 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:03:34,543 INFO L423 AbstractCegarLoop]: === Iteration 530 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:34,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1069499672, now seen corresponding path program 512 times [2018-12-03 17:03:34,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:34,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:34,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:34,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:34,627 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 17:03:34,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:34,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:34,628 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:34,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:34,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:34,628 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 530 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 530 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:34,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:34,636 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:34,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:03:34,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:34,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:34,645 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 17:03:34,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:34,773 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 17:03:34,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:34,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:34,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:34,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:34,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:34,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:34,791 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:03:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:36,559 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:03:36,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:36,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:36,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:36,559 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:03:36,559 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:03:36,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:03:37,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 17:03:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:37,458 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:37,459 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:37,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:37,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:37,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:37,459 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:03:37,459 INFO L423 AbstractCegarLoop]: === Iteration 531 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:37,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:37,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1069497750, now seen corresponding path program 513 times [2018-12-03 17:03:37,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:37,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:37,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:37,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:37,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:37,537 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 17:03:37,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:37,537 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:37,537 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:37,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:37,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:37,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 531 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 531 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:37,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:37,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:37,555 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:37,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:37,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:37,557 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 17:03:37,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:37,819 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 17:03:37,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:37,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:37,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:37,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:37,838 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:39,448 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:03:39,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:39,448 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:39,449 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:03:39,449 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:03:39,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 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 17:03:39,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:03:40,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 17:03:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:03:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:03:40,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:03:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:40,277 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:03:40,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:03:40,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:40,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:40,278 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:03:40,278 INFO L423 AbstractCegarLoop]: === Iteration 532 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:40,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1067712212, now seen corresponding path program 514 times [2018-12-03 17:03:40,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:40,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:40,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:40,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:40,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:40,352 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 17:03:40,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:40,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:40,352 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:40,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:40,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:40,353 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 532 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 532 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:40,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:40,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:40,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:40,368 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 17:03:40,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:40,509 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 17:03:40,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:40,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:40,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:40,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:40,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:40,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:40,529 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:03:42,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:42,259 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:03:42,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:42,259 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:42,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:42,259 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:03:42,259 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:03:42,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:03:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 17:03:43,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:43,153 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:43,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:43,153 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:43,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:43,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:43,153 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:03:43,154 INFO L423 AbstractCegarLoop]: === Iteration 533 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:43,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:43,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1067710290, now seen corresponding path program 515 times [2018-12-03 17:03:43,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:43,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:43,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:43,237 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 17:03:43,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:43,237 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:43,237 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:43,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:43,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:43,238 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 533 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 533 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:43,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:43,246 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:43,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:03:43,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:43,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:43,264 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 17:03:43,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:43,393 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 17:03:43,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:43,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:43,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:43,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:43,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:43,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:43,413 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:45,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:45,154 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:03:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:45,154 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:45,155 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:03:45,155 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:03:45,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:03:46,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 17:03:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:03:46,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:03:46,033 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:03:46,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:46,033 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:03:46,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:03:46,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:46,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:46,033 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:03:46,034 INFO L423 AbstractCegarLoop]: === Iteration 534 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:46,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:46,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1067652630, now seen corresponding path program 516 times [2018-12-03 17:03:46,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:46,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:46,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:46,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:46,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:46,109 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 17:03:46,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:46,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:46,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:46,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:46,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:46,109 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 534 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 534 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:46,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:46,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:46,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:46,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:46,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:46,126 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 17:03:46,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:46,257 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 17:03:46,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:46,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:46,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:46,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:46,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:46,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:46,276 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:03:47,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:47,927 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:03:47,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:47,927 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:47,927 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:03:47,927 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:03:47,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:03:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 17:03:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:48,816 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:48,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:48,816 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:48,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:48,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:48,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:48,816 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:03:48,816 INFO L423 AbstractCegarLoop]: === Iteration 535 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:48,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:48,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1067650708, now seen corresponding path program 517 times [2018-12-03 17:03:48,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:48,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:48,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:48,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:48,888 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 17:03:48,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:48,889 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:48,889 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:48,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:48,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:48,889 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 535 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 535 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:48,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:48,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:48,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:48,907 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 17:03:48,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:49,045 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 17:03:49,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:49,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:49,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:49,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:49,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:49,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:49,066 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:50,690 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:03:50,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:50,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:50,690 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:03:50,691 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:03:50,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:50,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:03:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 18. [2018-12-03 17:03:51,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:03:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:03:51,482 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 17:03:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:51,482 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:03:51,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:51,482 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:03:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:51,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:51,483 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:03:51,483 INFO L423 AbstractCegarLoop]: === Iteration 536 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:51,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:51,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1012300952, now seen corresponding path program 518 times [2018-12-03 17:03:51,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:51,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:51,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:51,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:51,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:51,557 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 17:03:51,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:51,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:51,558 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:51,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 17:03:51,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:51,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 536 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 536 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:51,567 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:51,567 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:51,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:03:51,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:51,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:51,577 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 17:03:51,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:51,701 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 17:03:51,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:51,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:51,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:51,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:51,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:51,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:51,720 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 17:03:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:53,310 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:03:53,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:53,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:53,311 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:03:53,311 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:03:53,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:53,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:03:54,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 17:03:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:54,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:54,200 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:54,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:54,201 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:54,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:54,201 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:54,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:54,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:54,201 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:03:54,201 INFO L423 AbstractCegarLoop]: === Iteration 537 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:54,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1012299030, now seen corresponding path program 519 times [2018-12-03 17:03:54,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:54,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:54,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:54,278 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 17:03:54,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:54,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:54,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:54,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:54,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:54,279 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 537 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 537 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:54,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:54,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:54,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:54,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:54,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:54,296 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 17:03:54,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:54,434 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 17:03:54,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:54,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:54,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:54,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:54,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:54,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:54,453 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:03:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:55,991 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:03:55,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:55,991 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:55,992 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:03:55,992 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:03:55,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:03:56,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 17:03:56,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:03:56,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:03:56,966 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:03:56,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:56,966 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:03:56,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:56,966 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:03:56,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:56,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:56,967 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:03:56,967 INFO L423 AbstractCegarLoop]: === Iteration 538 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:56,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:56,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1012241370, now seen corresponding path program 520 times [2018-12-03 17:03:56,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:56,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:56,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:56,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:56,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:57,039 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 17:03:57,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:57,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:57,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:57,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:57,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:57,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 538 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 538 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:57,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:57,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:57,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:57,058 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 17:03:57,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:57,182 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 17:03:57,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:57,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:57,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:57,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:57,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:57,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:57,201 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:03:58,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:58,818 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:03:58,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:03:58,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:03:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:58,819 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:03:58,819 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:03:58,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:03:59,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 17:03:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:03:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:03:59,728 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:03:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:59,728 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:03:59,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:03:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:03:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:03:59,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:59,728 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:03:59,728 INFO L423 AbstractCegarLoop]: === Iteration 539 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:59,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:59,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1012239448, now seen corresponding path program 521 times [2018-12-03 17:03:59,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:59,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:59,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:59,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:59,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:59,809 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 17:03:59,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:59,809 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:59,809 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:59,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:59,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:59,809 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 539 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 539 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:59,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:59,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:59,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:03:59,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:59,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:59,827 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 17:03:59,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:59,958 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 17:03:59,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:59,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:03:59,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:59,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:03:59,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:03:59,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:03:59,978 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:01,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:01,552 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:04:01,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:01,552 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:01,552 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:04:01,552 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:04:01,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:04:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 17:04:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:04:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:04:02,398 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:04:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:02,398 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:04:02,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:04:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:02,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:02,398 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:04:02,398 INFO L423 AbstractCegarLoop]: === Iteration 540 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:02,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1010453910, now seen corresponding path program 522 times [2018-12-03 17:04:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:02,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:02,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:02,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:02,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:02,483 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 17:04:02,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:02,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:02,484 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:02,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:02,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:02,484 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 540 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 540 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:02,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:02,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:02,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:02,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:02,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:02,504 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 17:04:02,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:02,642 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 17:04:02,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:02,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:02,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:02,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:02,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:02,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:02,662 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:04:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:04,116 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:04:04,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:04,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:04,116 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:04:04,116 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:04:04,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:04:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-12-03 17:04:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:05,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:05,011 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:05,011 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:05,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:05,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:05,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:05,011 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:04:05,011 INFO L423 AbstractCegarLoop]: === Iteration 541 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:05,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1010451988, now seen corresponding path program 523 times [2018-12-03 17:04:05,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:05,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:05,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:05,091 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 17:04:05,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:05,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:05,091 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:05,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:05,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:05,091 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 541 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 541 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:05,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:05,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:05,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:05,107 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 17:04:05,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:05,231 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 17:04:05,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:05,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:05,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:05,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:05,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:05,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:05,252 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:06,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:06,792 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:04:06,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:06,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:06,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:06,793 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:04:06,793 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:04:06,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:04:07,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 17:04:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:04:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:04:07,686 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:04:07,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:07,686 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:04:07,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:07,686 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:04:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:07,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:07,686 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:04:07,686 INFO L423 AbstractCegarLoop]: === Iteration 542 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:07,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:07,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1010394328, now seen corresponding path program 524 times [2018-12-03 17:04:07,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:07,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:07,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:07,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:07,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:07,759 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 17:04:07,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:07,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:07,760 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:07,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:07,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:07,760 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 542 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 542 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:07,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:07,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:07,777 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:04:07,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:07,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:07,779 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 17:04:07,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:07,925 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 17:04:07,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:07,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:07,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:07,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:07,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:07,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:07,945 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:04:09,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:09,371 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:04:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:09,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:09,371 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:04:09,371 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:04:09,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:04:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-12-03 17:04:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:10,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:10,273 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:10,273 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:10,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:10,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:10,274 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:04:10,274 INFO L423 AbstractCegarLoop]: === Iteration 543 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:10,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1010392406, now seen corresponding path program 525 times [2018-12-03 17:04:10,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:10,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:10,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:10,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:10,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:10,350 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 17:04:10,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:10,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:10,351 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:10,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:10,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:10,351 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 543 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 543 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:10,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:10,362 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:10,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:10,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:10,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:10,371 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 17:04:10,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:10,498 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 17:04:10,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:10,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:10,517 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:10,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:10,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:10,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:10,518 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:11,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:11,897 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:04:11,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:11,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:11,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:11,898 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:04:11,898 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:04:11,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:11,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:04:12,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 16. [2018-12-03 17:04:12,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:04:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 17:04:12,545 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 12 [2018-12-03 17:04:12,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:12,545 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 17:04:12,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 17:04:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:12,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:12,546 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 17:04:12,546 INFO L423 AbstractCegarLoop]: === Iteration 544 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:12,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:12,546 INFO L82 PathProgramCache]: Analyzing trace with hash 641054054, now seen corresponding path program 526 times [2018-12-03 17:04:12,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:12,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:12,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:12,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:12,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:12,642 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 17:04:12,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:12,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:12,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:12,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:12,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:12,643 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 544 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 544 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:12,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:12,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:12,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:12,662 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 17:04:12,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:12,799 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 17:04:12,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:12,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:12,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:12,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:12,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:12,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:12,819 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 12 states. [2018-12-03 17:04:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:14,823 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 17:04:14,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:14,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:14,824 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:04:14,824 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:04:14,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:04:15,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 17:04:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:15,755 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:15,756 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:15,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:15,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:15,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:15,756 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:04:15,756 INFO L423 AbstractCegarLoop]: === Iteration 545 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:15,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:15,756 INFO L82 PathProgramCache]: Analyzing trace with hash 641055976, now seen corresponding path program 527 times [2018-12-03 17:04:15,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:15,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:15,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:15,832 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 17:04:15,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:15,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:15,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:15,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:15,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:15,832 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 545 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 545 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:15,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:15,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:15,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:04:15,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:15,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:15,851 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 17:04:15,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:15,980 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 17:04:15,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:15,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:15,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:15,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:15,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:15,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:15,999 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:17,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:17,964 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 17:04:17,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:17,964 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:17,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:17,964 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:04:17,964 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:04:17,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:04:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 17:04:18,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:04:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:04:18,872 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:04:18,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:18,872 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:04:18,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:18,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:04:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:18,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:18,872 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:04:18,873 INFO L423 AbstractCegarLoop]: === Iteration 546 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:18,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:18,873 INFO L82 PathProgramCache]: Analyzing trace with hash 641113636, now seen corresponding path program 528 times [2018-12-03 17:04:18,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:18,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:18,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:18,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:18,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:18,993 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 17:04:18,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:18,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:18,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:18,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:18,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:18,994 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 546 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 546 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:19,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:19,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:19,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:19,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:19,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:19,013 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 17:04:19,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:19,125 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 17:04:19,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:19,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:19,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:19,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:19,145 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:04:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:21,146 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 17:04:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:21,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:21,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:21,147 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:04:21,147 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:04:21,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:04:22,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 17:04:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:22,065 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:22,065 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:22,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:22,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:22,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:22,065 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:04:22,065 INFO L423 AbstractCegarLoop]: === Iteration 547 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:22,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:22,065 INFO L82 PathProgramCache]: Analyzing trace with hash 641115558, now seen corresponding path program 529 times [2018-12-03 17:04:22,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:22,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:22,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:22,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:22,141 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 17:04:22,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:22,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:22,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:22,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:22,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:22,142 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 547 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 547 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:22,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:22,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:22,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:22,158 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 17:04:22,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:22,288 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 17:04:22,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:22,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:22,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:22,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:22,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:22,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:22,306 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:24,309 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 17:04:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:24,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:24,310 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:04:24,310 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:04:24,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:24,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:04:25,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-12-03 17:04:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:04:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:04:25,176 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:04:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:25,176 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:04:25,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:25,176 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:04:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:25,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:25,176 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:04:25,176 INFO L423 AbstractCegarLoop]: === Iteration 548 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:25,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 642901096, now seen corresponding path program 530 times [2018-12-03 17:04:25,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:25,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:25,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:25,250 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 17:04:25,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:25,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:25,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:25,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 17:04:25,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:25,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 548 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 548 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:25,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:25,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:25,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:04:25,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:25,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:25,270 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 17:04:25,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:25,403 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 17:04:25,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:25,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:25,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:25,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:25,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:25,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:25,422 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:04:27,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:27,320 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 17:04:27,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:27,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:27,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:27,321 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:04:27,321 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:04:27,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:04:28,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2018-12-03 17:04:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:28,244 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:28,244 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:28,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:28,244 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:28,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:28,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:28,244 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:04:28,244 INFO L423 AbstractCegarLoop]: === Iteration 549 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:28,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:28,245 INFO L82 PathProgramCache]: Analyzing trace with hash 642903018, now seen corresponding path program 531 times [2018-12-03 17:04:28,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:28,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:28,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:28,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:28,321 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 17:04:28,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:28,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:28,322 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:28,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:28,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:28,322 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 549 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 549 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:28,331 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:28,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:28,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:28,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:28,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:28,339 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 17:04:28,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:28,483 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 17:04:28,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:28,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:28,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:28,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:28,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:28,503 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:30,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:30,376 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 17:04:30,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:30,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:30,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:30,377 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:04:30,377 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:04:30,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:30,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:04:31,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-03 17:04:31,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:04:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:04:31,312 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:04:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:31,312 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:04:31,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:04:31,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:31,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:31,312 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:04:31,312 INFO L423 AbstractCegarLoop]: === Iteration 550 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:31,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:31,312 INFO L82 PathProgramCache]: Analyzing trace with hash 642960678, now seen corresponding path program 532 times [2018-12-03 17:04:31,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:31,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:31,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:31,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:31,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:31,447 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 17:04:31,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:31,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:31,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:31,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:31,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:31,448 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 550 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 550 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:31,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:31,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:31,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:31,464 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 17:04:31,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:31,589 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 17:04:31,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:31,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:31,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:31,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:31,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:31,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:31,609 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:04:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:33,438 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:04:33,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:33,438 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:33,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:33,438 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:04:33,438 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:04:33,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:33,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:04:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 17:04:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:34,380 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:34,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:34,380 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:34,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:34,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:34,381 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:04:34,381 INFO L423 AbstractCegarLoop]: === Iteration 551 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:34,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:34,381 INFO L82 PathProgramCache]: Analyzing trace with hash 642962600, now seen corresponding path program 533 times [2018-12-03 17:04:34,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:34,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:34,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:34,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:34,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:34,465 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 17:04:34,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:34,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:34,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:34,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:34,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:34,466 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 551 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 551 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:34,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:34,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:34,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:04:34,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:34,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:34,483 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 17:04:34,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:34,605 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 17:04:34,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:34,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:34,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:34,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:34,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:34,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:34,624 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:36,342 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:04:36,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:36,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:36,343 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:04:36,343 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:04:36,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:36,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:04:37,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 18. [2018-12-03 17:04:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:04:37,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:04:37,137 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 17:04:37,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:37,137 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:04:37,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:37,137 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:04:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:37,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:37,137 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:04:37,137 INFO L423 AbstractCegarLoop]: === Iteration 552 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:37,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:37,138 INFO L82 PathProgramCache]: Analyzing trace with hash 698312356, now seen corresponding path program 534 times [2018-12-03 17:04:37,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:37,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:37,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:37,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:37,212 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 17:04:37,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:37,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:37,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:37,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:37,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:37,213 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 552 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 552 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:37,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:37,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:37,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:37,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:37,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:37,229 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 17:04:37,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:37,351 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 17:04:37,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:37,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:37,371 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:37,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:37,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:37,371 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 17:04:39,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:39,362 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 17:04:39,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:39,362 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:39,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:39,363 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:04:39,363 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:04:39,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:39,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:04:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 17:04:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:40,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:40,274 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:40,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:40,274 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:40,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:40,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:40,274 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:04:40,275 INFO L423 AbstractCegarLoop]: === Iteration 553 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:40,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:40,275 INFO L82 PathProgramCache]: Analyzing trace with hash 698314278, now seen corresponding path program 535 times [2018-12-03 17:04:40,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:40,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:40,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:40,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:40,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:40,365 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 17:04:40,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:40,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:40,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:40,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:40,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:40,366 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 553 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 553 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:40,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:40,376 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:40,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:40,383 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 17:04:40,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:40,508 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 17:04:40,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:40,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:40,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:40,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:40,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:40,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:40,528 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:42,445 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 17:04:42,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:42,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:42,446 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:04:42,446 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:04:42,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:42,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:04:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 20. [2018-12-03 17:04:43,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:04:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:04:43,351 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:04:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:43,351 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:04:43,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:04:43,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:43,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:43,352 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:04:43,352 INFO L423 AbstractCegarLoop]: === Iteration 554 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:43,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:43,352 INFO L82 PathProgramCache]: Analyzing trace with hash 698371938, now seen corresponding path program 536 times [2018-12-03 17:04:43,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:43,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:43,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:43,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:43,432 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 17:04:43,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:43,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:43,433 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:43,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:43,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:43,433 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 554 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 554 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:43,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:43,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:43,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:04:43,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:43,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:43,455 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 17:04:43,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:43,587 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 17:04:43,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:43,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:43,605 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:43,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:43,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:43,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:43,606 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:04:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:45,619 INFO L93 Difference]: Finished difference Result 40 states and 75 transitions. [2018-12-03 17:04:45,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:45,619 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:45,620 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:04:45,620 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:04:45,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:45,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:04:46,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 21. [2018-12-03 17:04:46,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:46,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:46,537 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:46,537 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:46,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:46,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:46,537 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:04:46,537 INFO L423 AbstractCegarLoop]: === Iteration 555 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:46,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 698373860, now seen corresponding path program 537 times [2018-12-03 17:04:46,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:46,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:46,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:46,610 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 17:04:46,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:46,611 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:46,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:46,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:46,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:46,611 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 555 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 555 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:46,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:46,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:46,625 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:46,625 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:46,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:46,628 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 17:04:46,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:46,780 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 17:04:46,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:46,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:46,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:46,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:46,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:46,799 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:48,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:48,735 INFO L93 Difference]: Finished difference Result 39 states and 73 transitions. [2018-12-03 17:04:48,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:48,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:48,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:48,736 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:04:48,736 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:04:48,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:04:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2018-12-03 17:04:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:04:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:04:49,610 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:04:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:49,611 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:04:49,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:04:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:49,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:49,611 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:04:49,611 INFO L423 AbstractCegarLoop]: === Iteration 556 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:49,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:49,611 INFO L82 PathProgramCache]: Analyzing trace with hash 700159398, now seen corresponding path program 538 times [2018-12-03 17:04:49,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:49,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:49,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:49,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:49,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:49,686 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 17:04:49,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:49,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:49,686 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:49,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:49,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:49,686 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 556 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 556 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:49,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:49,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:49,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:49,703 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 17:04:49,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:49,833 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 17:04:49,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:49,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:49,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:49,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:49,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:49,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:49,854 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:04:51,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:51,728 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 17:04:51,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:51,728 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:51,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:51,728 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:04:51,728 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:04:51,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:04:52,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 21. [2018-12-03 17:04:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:52,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:52,644 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:52,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:52,645 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:52,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:52,645 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:04:52,645 INFO L423 AbstractCegarLoop]: === Iteration 557 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:52,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:52,645 INFO L82 PathProgramCache]: Analyzing trace with hash 700161320, now seen corresponding path program 539 times [2018-12-03 17:04:52,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:52,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:52,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:52,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:52,717 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 17:04:52,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:52,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:52,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:52,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:52,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:52,718 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 557 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 557 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:52,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:52,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:52,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:04:52,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:52,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:52,738 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 17:04:52,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:52,862 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 17:04:52,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:52,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:52,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:52,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:52,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:52,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:52,882 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:04:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:54,738 INFO L93 Difference]: Finished difference Result 38 states and 71 transitions. [2018-12-03 17:04:54,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:54,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:54,739 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:04:54,739 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:04:54,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:04:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2018-12-03 17:04:55,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:04:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:04:55,649 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:04:55,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:55,649 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:04:55,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:55,649 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:04:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:55,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:55,649 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:04:55,649 INFO L423 AbstractCegarLoop]: === Iteration 558 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:55,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:55,649 INFO L82 PathProgramCache]: Analyzing trace with hash 700218980, now seen corresponding path program 540 times [2018-12-03 17:04:55,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:55,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:55,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:55,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:55,726 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 17:04:55,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:55,726 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:55,726 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:55,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:55,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:55,726 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 558 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 558 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:55,735 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:55,735 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:55,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:55,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:55,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:55,743 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 17:04:55,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:55,872 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 17:04:55,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:55,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:55,891 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:55,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:55,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:55,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:55,892 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:04:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:57,698 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:04:57,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:04:57,698 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:04:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:57,699 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:04:57,699 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:04:57,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:04:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 17:04:58,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:04:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:04:58,629 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:04:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:58,629 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:04:58,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:04:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:04:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:04:58,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:58,629 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:04:58,629 INFO L423 AbstractCegarLoop]: === Iteration 559 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:58,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash 700220902, now seen corresponding path program 541 times [2018-12-03 17:04:58,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:58,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:58,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:58,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:58,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:58,702 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 17:04:58,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:58,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:58,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:58,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:58,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:58,703 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 559 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 559 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:58,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:58,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:58,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:58,717 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 17:04:58,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:58,861 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 17:04:58,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:58,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:04:58,880 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:58,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:04:58,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:04:58,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:04:58,881 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:00,638 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:05:00,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:00,638 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:00,639 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:05:00,639 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:05:00,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:05:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 17. [2018-12-03 17:05:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:05:01,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 17:05:01,365 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 12 [2018-12-03 17:05:01,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:01,365 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 17:05:01,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:01,365 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 17:05:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:01,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:01,365 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:05:01,366 INFO L423 AbstractCegarLoop]: === Iteration 560 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:01,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:01,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1878905880, now seen corresponding path program 542 times [2018-12-03 17:05:01,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:01,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:01,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:01,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:01,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:01,440 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 17:05:01,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:01,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:01,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:01,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:01,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:01,440 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 560 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 560 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:01,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:01,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:01,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:05:01,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:01,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:01,458 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 17:05:01,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:01,594 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 17:05:01,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:01,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:01,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:01,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:01,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:01,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:01,614 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 12 states. [2018-12-03 17:05:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:03,437 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:05:03,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:03,437 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:03,438 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:05:03,438 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:05:03,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:05:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 17:05:04,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:04,364 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:04,364 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:04,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:04,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:04,365 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:05:04,365 INFO L423 AbstractCegarLoop]: === Iteration 561 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:04,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:04,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1878903958, now seen corresponding path program 543 times [2018-12-03 17:05:04,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:04,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:04,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:04,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:04,447 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 17:05:04,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:04,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:04,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:04,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:04,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:04,448 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 561 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 561 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:04,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:04,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:04,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:04,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:04,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:04,464 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 17:05:04,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:04,588 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 17:05:04,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:04,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:04,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:04,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:04,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:04,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:04,607 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:06,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:06,440 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:05:06,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:06,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:06,440 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:05:06,440 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:05:06,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:06,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:05:07,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 17:05:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:05:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:05:07,351 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:05:07,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:07,351 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:05:07,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:07,351 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:05:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:07,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:07,351 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:05:07,351 INFO L423 AbstractCegarLoop]: === Iteration 562 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:07,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1878846298, now seen corresponding path program 544 times [2018-12-03 17:05:07,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:07,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:07,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:07,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:07,425 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 17:05:07,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:07,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:07,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:07,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:07,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:07,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 562 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 562 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:07,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:07,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:07,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:07,442 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 17:05:07,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:07,571 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 17:05:07,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:07,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:07,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:07,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:07,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:07,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:07,590 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:05:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:09,310 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:05:09,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:09,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:09,310 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:05:09,311 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:05:09,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:05:10,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 17:05:10,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:10,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:10,253 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:10,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:10,253 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:10,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:10,253 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:10,253 INFO L423 AbstractCegarLoop]: === Iteration 563 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:10,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1878844376, now seen corresponding path program 545 times [2018-12-03 17:05:10,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:10,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:10,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:10,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:10,327 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 17:05:10,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:10,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:10,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:10,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:10,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:10,328 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 563 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 563 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:10,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:10,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:10,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:05:10,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:10,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:10,346 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 17:05:10,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:10,476 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 17:05:10,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:10,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:10,495 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:10,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:10,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:10,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:10,495 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:12,201 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:05:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:12,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:12,201 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:05:12,201 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:05:12,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:12,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:05:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 19. [2018-12-03 17:05:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:05:13,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:05:13,066 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:05:13,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:13,067 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:05:13,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:13,067 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:05:13,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:13,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:13,067 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:05:13,067 INFO L423 AbstractCegarLoop]: === Iteration 564 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:13,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:13,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1877058838, now seen corresponding path program 546 times [2018-12-03 17:05:13,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:13,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:13,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:13,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:13,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:13,141 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 17:05:13,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:13,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:13,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:13,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:13,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:13,141 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 564 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 564 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:13,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:13,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:13,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:13,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:13,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:13,158 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 17:05:13,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:13,292 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 17:05:13,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:13,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:13,310 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:13,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:13,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:13,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:13,310 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:05:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:15,125 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:05:15,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:15,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:15,126 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:05:15,126 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:05:15,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:05:16,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2018-12-03 17:05:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:16,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:16,053 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:16,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:16,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:16,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:16,053 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:16,053 INFO L423 AbstractCegarLoop]: === Iteration 565 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:16,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:16,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1877056916, now seen corresponding path program 547 times [2018-12-03 17:05:16,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:16,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:16,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:16,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:16,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:16,128 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 17:05:16,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:16,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:16,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:16,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:16,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:16,129 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 565 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 565 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:16,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:16,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:16,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:16,147 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 17:05:16,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:16,322 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 17:05:16,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:16,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:16,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:16,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:16,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:16,341 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:18,167 INFO L93 Difference]: Finished difference Result 37 states and 69 transitions. [2018-12-03 17:05:18,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:18,167 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:18,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:18,168 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:05:18,168 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:05:18,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:18,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:05:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-12-03 17:05:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:05:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:05:19,077 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:05:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:19,077 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:05:19,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:05:19,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:19,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:19,078 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:19,078 INFO L423 AbstractCegarLoop]: === Iteration 566 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:19,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:19,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1876999256, now seen corresponding path program 548 times [2018-12-03 17:05:19,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:19,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:19,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:19,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:19,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:19,154 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 17:05:19,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:19,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:19,155 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:19,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:19,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:19,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 566 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 566 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:19,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:19,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:19,171 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:05:19,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:19,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:19,173 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 17:05:19,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:19,297 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 17:05:19,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:19,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:19,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:19,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:19,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:19,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:19,316 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:05:21,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:21,060 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:05:21,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:21,060 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:21,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:21,060 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:05:21,060 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:05:21,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:05:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 17:05:21,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:21,993 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:21,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:21,993 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:21,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:21,993 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:21,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:21,993 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:21,994 INFO L423 AbstractCegarLoop]: === Iteration 567 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:21,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:21,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1876997334, now seen corresponding path program 549 times [2018-12-03 17:05:21,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:21,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:21,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:21,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:21,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:22,068 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 17:05:22,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:22,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:22,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:22,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:22,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:22,068 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 567 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 567 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:22,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:22,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:22,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:22,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:22,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:22,085 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 17:05:22,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:22,227 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 17:05:22,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:22,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:22,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:22,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:22,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:22,247 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:23,912 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:05:23,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:23,912 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:23,912 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:05:23,912 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:05:23,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:05:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 18. [2018-12-03 17:05:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:05:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:05:24,727 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 17:05:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:24,727 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:05:24,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:05:24,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:24,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:24,728 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:05:24,728 INFO L423 AbstractCegarLoop]: === Iteration 568 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:24,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:24,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1821647578, now seen corresponding path program 550 times [2018-12-03 17:05:24,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:24,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:24,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:24,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:24,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:24,836 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 17:05:24,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:24,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:24,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:24,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 17:05:24,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:24,837 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 568 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 568 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:24,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:24,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:24,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:24,854 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 17:05:24,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:24,967 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 17:05:24,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:24,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:24,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:24,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:24,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:24,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:24,987 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 17:05:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:26,686 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:05:26,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:26,686 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:26,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:26,687 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:05:26,687 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:05:26,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:05:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 17:05:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:27,626 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:27,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:27,626 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:27,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:27,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:27,626 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:27,626 INFO L423 AbstractCegarLoop]: === Iteration 569 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:27,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1821645656, now seen corresponding path program 551 times [2018-12-03 17:05:27,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:27,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:27,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:27,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:27,702 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 17:05:27,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:27,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:27,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:27,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:27,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:27,703 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 569 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 569 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:27,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:27,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:27,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:05:27,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:27,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:27,723 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 17:05:27,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:27,859 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 17:05:27,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:27,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:27,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:27,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:27,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:27,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:27,877 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:29,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:29,465 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:05:29,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:29,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:29,466 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:05:29,466 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:05:29,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:05:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-12-03 17:05:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:05:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:05:30,384 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:05:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:30,384 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:05:30,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:30,385 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:05:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:30,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:30,385 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:30,385 INFO L423 AbstractCegarLoop]: === Iteration 570 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:30,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:30,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1821587996, now seen corresponding path program 552 times [2018-12-03 17:05:30,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:30,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:30,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:30,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:30,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:30,471 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 17:05:30,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:30,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:30,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:30,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:30,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:30,472 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 570 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 570 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:30,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:30,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:30,486 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:30,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:30,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:30,489 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 17:05:30,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:30,615 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 17:05:30,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:30,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:30,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:30,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:30,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:30,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:30,634 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:05:32,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:32,344 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:05:32,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:32,344 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:32,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:32,345 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:05:32,345 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:05:32,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:05:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 17:05:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:33,300 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:33,300 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:33,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:33,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:33,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:33,300 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:33,300 INFO L423 AbstractCegarLoop]: === Iteration 571 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:33,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:33,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1821586074, now seen corresponding path program 553 times [2018-12-03 17:05:33,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:33,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:33,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:33,375 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 17:05:33,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:33,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:33,376 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:33,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:33,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:33,376 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 571 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 571 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:33,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:33,385 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:33,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:33,393 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 17:05:33,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:33,532 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 17:05:33,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:33,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:33,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:33,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:33,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:33,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:33,552 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:35,179 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:05:35,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:35,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:35,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:35,180 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:05:35,180 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:05:35,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:35,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:05:36,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 17:05:36,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:05:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:05:36,066 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:05:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:36,067 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:05:36,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:36,067 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:05:36,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:36,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:36,067 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:36,067 INFO L423 AbstractCegarLoop]: === Iteration 572 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:36,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:36,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1819800536, now seen corresponding path program 554 times [2018-12-03 17:05:36,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:36,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:36,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:36,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:36,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:36,151 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 17:05:36,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:36,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:36,152 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:36,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:36,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:36,152 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 572 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 572 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:36,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:36,161 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:36,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:05:36,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:36,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:36,171 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 17:05:36,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:36,296 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 17:05:36,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:36,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:36,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:36,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:36,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:36,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:36,316 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:05:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:37,842 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:05:37,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:37,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:37,842 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:05:37,842 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:05:37,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:05:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-12-03 17:05:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:38,779 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:38,779 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:38,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:38,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:38,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:38,779 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:38,779 INFO L423 AbstractCegarLoop]: === Iteration 573 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:38,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1819798614, now seen corresponding path program 555 times [2018-12-03 17:05:38,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:38,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:38,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:38,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:38,855 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 17:05:38,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:38,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:38,855 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:38,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:38,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:38,855 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 573 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 573 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:38,864 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:38,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:38,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:38,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:38,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:38,873 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 17:05:38,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:39,000 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 17:05:39,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:39,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:39,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:39,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:39,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:39,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:39,020 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:40,600 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:05:40,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:40,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:40,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:40,600 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:05:40,600 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:05:40,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:05:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 17:05:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:05:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:05:41,523 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:05:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:41,523 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:05:41,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:05:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:41,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:41,524 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:05:41,524 INFO L423 AbstractCegarLoop]: === Iteration 574 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:41,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:41,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1819740954, now seen corresponding path program 556 times [2018-12-03 17:05:41,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:41,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:41,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:41,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:41,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:41,597 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 17:05:41,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:41,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:41,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:41,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:41,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:41,598 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 574 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 574 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:41,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:41,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:41,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:41,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:41,615 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 17:05:41,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:41,739 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 17:05:41,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:41,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:41,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:41,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:41,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:41,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:41,759 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:05:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:43,247 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:05:43,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:43,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:43,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:43,248 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:05:43,248 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:05:43,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:05:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-12-03 17:05:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:44,182 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:44,182 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:44,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:44,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:44,183 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:05:44,183 INFO L423 AbstractCegarLoop]: === Iteration 575 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:44,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1819739032, now seen corresponding path program 557 times [2018-12-03 17:05:44,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:44,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:44,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:44,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:44,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:44,262 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 17:05:44,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:44,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:44,263 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:44,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:44,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:44,263 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 575 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 575 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:44,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:44,273 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:44,280 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:05:44,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:44,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:44,282 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 17:05:44,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:44,423 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 17:05:44,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:44,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:44,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:44,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:44,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:44,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:44,443 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:45,877 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:05:45,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:45,877 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:45,877 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:05:45,877 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:05:45,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:45,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:05:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 15. [2018-12-03 17:05:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:05:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 27 transitions. [2018-12-03 17:05:46,482 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 27 transitions. Word has length 12 [2018-12-03 17:05:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:46,482 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 27 transitions. [2018-12-03 17:05:46,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 27 transitions. [2018-12-03 17:05:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:46,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:46,482 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 17:05:46,482 INFO L423 AbstractCegarLoop]: === Iteration 576 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:46,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash 2130459050, now seen corresponding path program 558 times [2018-12-03 17:05:46,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:46,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:46,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:46,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:46,564 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 17:05:46,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:46,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:46,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:46,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:46,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:46,564 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 576 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 576 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:46,575 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:46,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:46,580 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:46,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:46,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:46,583 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 17:05:46,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:46,714 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 17:05:46,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:46,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:46,733 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:46,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:46,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:46,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:46,733 INFO L87 Difference]: Start difference. First operand 15 states and 27 transitions. Second operand 12 states. [2018-12-03 17:05:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:48,583 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:05:48,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:48,583 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:48,583 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:05:48,583 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:05:48,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:48,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:05:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 17:05:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:49,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:49,588 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:49,588 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:49,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:49,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:49,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:49,588 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:05:49,588 INFO L423 AbstractCegarLoop]: === Iteration 577 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:49,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:49,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2130460972, now seen corresponding path program 559 times [2018-12-03 17:05:49,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:49,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:49,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:49,671 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 17:05:49,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:49,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:49,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:49,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:49,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:49,672 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 577 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 577 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:49,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:49,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:49,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:49,690 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 17:05:49,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:49,826 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 17:05:49,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:49,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:49,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:49,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:49,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:49,844 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:51,654 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:05:51,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:51,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:51,654 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:05:51,654 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:05:51,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:51,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:05:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 17:05:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:05:52,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:05:52,669 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:05:52,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:52,669 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:05:52,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:52,669 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:05:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:52,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:52,669 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:05:52,669 INFO L423 AbstractCegarLoop]: === Iteration 578 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:52,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:52,670 INFO L82 PathProgramCache]: Analyzing trace with hash 2130518632, now seen corresponding path program 560 times [2018-12-03 17:05:52,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:52,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:52,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:52,748 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 17:05:52,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:52,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:52,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:52,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:52,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:52,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 578 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 578 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:52,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:52,758 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:52,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:05:52,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:52,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:52,768 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 17:05:52,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:52,893 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 17:05:52,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:52,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:52,911 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:52,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:52,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:52,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:52,912 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:05:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:54,680 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:05:54,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:54,680 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:54,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:54,680 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:05:54,680 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:05:54,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:05:55,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 17:05:55,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:05:55,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:05:55,668 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:05:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:55,668 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:05:55,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:05:55,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:55,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:55,668 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:05:55,668 INFO L423 AbstractCegarLoop]: === Iteration 579 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:55,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:55,669 INFO L82 PathProgramCache]: Analyzing trace with hash 2130520554, now seen corresponding path program 561 times [2018-12-03 17:05:55,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:55,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:55,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:55,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:55,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:55,775 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 17:05:55,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:55,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:55,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:55,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:55,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:55,775 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 579 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 579 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:55,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:55,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:55,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:55,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:55,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:55,794 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 17:05:55,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:55,951 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 17:05:55,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:55,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:55,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:55,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:55,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:55,970 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:05:57,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:57,708 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:05:57,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:05:57,708 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:05:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:57,708 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:05:57,708 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:05:57,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:05:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 17:05:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:05:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:05:58,640 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:05:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:58,640 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:05:58,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:05:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:05:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:05:58,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:58,641 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:05:58,641 INFO L423 AbstractCegarLoop]: === Iteration 580 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:58,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:58,641 INFO L82 PathProgramCache]: Analyzing trace with hash 2132306092, now seen corresponding path program 562 times [2018-12-03 17:05:58,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:58,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:58,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:58,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:58,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:58,715 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 17:05:58,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:58,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:58,715 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:58,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:58,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:58,715 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 580 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 580 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:58,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:58,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:58,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:58,734 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 17:05:58,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:58,854 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 17:05:58,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:58,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:05:58,872 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:58,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:05:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:05:58,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:05:58,873 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:06:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:00,701 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:06:00,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:00,701 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:00,702 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:06:00,702 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:06:00,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:00,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:06:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 17:06:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:01,698 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:01,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:01,698 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:01,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:01,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:01,699 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:06:01,699 INFO L423 AbstractCegarLoop]: === Iteration 581 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:01,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:01,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2132308014, now seen corresponding path program 563 times [2018-12-03 17:06:01,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:01,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:01,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:01,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:01,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:01,798 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 17:06:01,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:01,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:01,799 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:01,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:01,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:01,799 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 581 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 581 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:01,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:01,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:01,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:06:01,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:01,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:01,819 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 17:06:01,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:01,995 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 17:06:02,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:02,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:02,014 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:02,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:02,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:02,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:02,014 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:03,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:03,833 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:06:03,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:03,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:03,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:03,834 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:06:03,834 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:06:03,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:03,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:06:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 17:06:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:06:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:06:04,806 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:06:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:04,806 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:06:04,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:06:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:04,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:04,806 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:06:04,806 INFO L423 AbstractCegarLoop]: === Iteration 582 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:04,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash 2132365674, now seen corresponding path program 564 times [2018-12-03 17:06:04,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:04,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:04,807 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:04,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:04,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:04,880 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 17:06:04,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:04,880 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:04,880 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:04,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:04,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:04,881 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 582 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 582 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:04,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:04,889 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:04,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:04,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:04,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:04,897 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 17:06:04,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:05,020 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 17:06:05,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:05,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:05,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:05,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:05,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:05,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:05,039 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:06:06,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:06,823 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:06:06,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:06,823 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:06,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:06,824 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:06:06,824 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:06:06,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:06,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:06:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 17:06:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:07,852 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:07,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:07,852 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:07,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:07,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:07,853 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:06:07,853 INFO L423 AbstractCegarLoop]: === Iteration 583 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:07,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:07,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2132367596, now seen corresponding path program 565 times [2018-12-03 17:06:07,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:07,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:07,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:07,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:07,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:07,928 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 17:06:07,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:07,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:07,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:07,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:07,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:07,929 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 583 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 583 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:07,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:07,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:07,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:07,945 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 17:06:07,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:08,077 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 17:06:08,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:08,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:08,096 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:08,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:08,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:08,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:08,097 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:09,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:09,803 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:06:09,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:09,803 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:09,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:09,804 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:06:09,804 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:06:09,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:06:10,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 17:06:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:06:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:06:10,677 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 17:06:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:10,678 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:06:10,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:06:10,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:10,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:10,678 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:06:10,678 INFO L423 AbstractCegarLoop]: === Iteration 584 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:10,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:10,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2107249944, now seen corresponding path program 566 times [2018-12-03 17:06:10,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:10,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:10,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:10,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:10,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:10,753 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 17:06:10,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:10,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:10,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:10,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:10,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:10,753 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 584 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 584 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:10,762 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:10,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:10,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:06:10,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:10,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:10,772 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 17:06:10,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:10,900 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 17:06:10,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:10,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:10,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:10,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:10,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:10,920 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 17:06:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:12,604 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:06:12,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:12,604 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:12,605 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:06:12,605 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:06:12,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:12,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:06:13,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-12-03 17:06:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:13,600 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:13,600 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:13,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:13,600 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:13,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:13,600 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:06:13,600 INFO L423 AbstractCegarLoop]: === Iteration 585 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:13,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:13,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2107248022, now seen corresponding path program 567 times [2018-12-03 17:06:13,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:13,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:13,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:13,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:13,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:13,675 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 17:06:13,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:13,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:13,675 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:13,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:13,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:13,675 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 585 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 585 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:13,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:13,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:13,690 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:13,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:13,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:13,692 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 17:06:13,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:13,836 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 17:06:13,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:13,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:13,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:13,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:13,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:13,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:13,856 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:15,486 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:06:15,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:15,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:15,491 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:06:15,491 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:06:15,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:15,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:06:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 17:06:16,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:06:16,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:06:16,472 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:06:16,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:16,472 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:06:16,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:16,472 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:06:16,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:16,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:16,472 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:06:16,472 INFO L423 AbstractCegarLoop]: === Iteration 586 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:16,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:16,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2107190362, now seen corresponding path program 568 times [2018-12-03 17:06:16,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:16,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:16,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:16,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:16,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:16,549 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 17:06:16,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:16,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:16,549 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:16,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:16,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:16,550 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 586 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 586 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:16,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:16,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:16,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:16,566 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 17:06:16,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:16,736 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 17:06:16,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:16,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:16,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:16,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:16,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:16,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:16,755 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:06:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:18,419 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:06:18,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:18,419 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:18,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:18,419 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:06:18,419 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:06:18,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:18,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:06:19,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-12-03 17:06:19,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:19,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:19,417 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:19,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:19,417 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:19,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:19,417 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:19,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:19,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:19,417 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:06:19,417 INFO L423 AbstractCegarLoop]: === Iteration 587 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:19,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:19,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2107188440, now seen corresponding path program 569 times [2018-12-03 17:06:19,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:19,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:19,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:19,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:19,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:19,491 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 17:06:19,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:19,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:19,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:19,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:19,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:19,492 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 587 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 587 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:19,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:19,502 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:19,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:06:19,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:19,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:19,511 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 17:06:19,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:19,638 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 17:06:19,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:19,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:19,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:19,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:19,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:19,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:19,657 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:21,304 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:06:21,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:21,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:21,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:21,305 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:06:21,305 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:06:21,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:21,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:06:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 17:06:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:06:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:06:22,248 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:06:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:22,248 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:06:22,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:22,248 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:06:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:22,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:22,248 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:06:22,248 INFO L423 AbstractCegarLoop]: === Iteration 588 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:22,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:22,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2105402902, now seen corresponding path program 570 times [2018-12-03 17:06:22,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:22,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:22,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:22,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:22,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:22,327 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 17:06:22,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:22,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:22,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:22,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:22,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:22,328 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 588 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 588 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:22,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:22,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:22,343 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:22,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:22,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:22,345 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 17:06:22,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:22,472 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 17:06:22,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:22,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:22,490 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:22,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:22,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:22,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:22,491 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:06:24,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:24,044 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:06:24,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:24,044 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:24,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:24,044 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:06:24,045 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:06:24,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:24,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:06:25,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-12-03 17:06:25,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:25,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:25,045 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:25,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:25,045 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:25,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:25,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:25,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:25,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:25,045 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:06:25,046 INFO L423 AbstractCegarLoop]: === Iteration 589 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:25,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:25,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2105400980, now seen corresponding path program 571 times [2018-12-03 17:06:25,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:25,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:25,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:25,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:25,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:25,120 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 17:06:25,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:25,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:25,121 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:25,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:25,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:25,121 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 589 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 589 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:25,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:25,130 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:25,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:25,136 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 17:06:25,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:25,277 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 17:06:25,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:25,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:25,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:25,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:25,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:25,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:25,296 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:26,848 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:06:26,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:26,848 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:26,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:26,849 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:06:26,849 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:06:26,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:06:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 17:06:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:06:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:06:27,826 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:06:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:27,827 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:06:27,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:27,827 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:06:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:27,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:27,827 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:06:27,827 INFO L423 AbstractCegarLoop]: === Iteration 590 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:27,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:27,827 INFO L82 PathProgramCache]: Analyzing trace with hash -2105343320, now seen corresponding path program 572 times [2018-12-03 17:06:27,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:27,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:27,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:27,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:27,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:27,921 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 17:06:27,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:27,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:27,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:27,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:27,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:27,922 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 590 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 590 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:27,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:27,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:27,939 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:06:27,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:27,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:27,941 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 17:06:27,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:28,074 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 17:06:28,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:28,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:28,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:28,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:28,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:28,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:28,093 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:06:29,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:29,573 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:06:29,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:29,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:29,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:29,574 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:06:29,574 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:06:29,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:06:30,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-12-03 17:06:30,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:30,575 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:30,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:30,575 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:30,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:30,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:30,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:30,576 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:06:30,576 INFO L423 AbstractCegarLoop]: === Iteration 591 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:30,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:30,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2105341398, now seen corresponding path program 573 times [2018-12-03 17:06:30,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:30,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:30,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:30,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:30,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:30,650 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 17:06:30,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:30,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:30,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:30,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:30,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:30,651 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 591 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 591 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:30,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:30,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:30,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:30,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:30,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:30,669 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 17:06:30,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:30,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:30,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:30,825 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:30,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:30,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:30,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:30,826 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:32,325 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 17:06:32,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:32,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:32,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:32,325 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:06:32,325 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:06:32,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:06:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 17. [2018-12-03 17:06:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:06:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2018-12-03 17:06:33,120 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 31 transitions. Word has length 12 [2018-12-03 17:06:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:33,120 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 31 transitions. [2018-12-03 17:06:33,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 31 transitions. [2018-12-03 17:06:33,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:33,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:33,120 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:06:33,121 INFO L423 AbstractCegarLoop]: === Iteration 592 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:33,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:33,121 INFO L82 PathProgramCache]: Analyzing trace with hash -389500884, now seen corresponding path program 574 times [2018-12-03 17:06:33,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:33,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:33,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:33,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:33,196 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 17:06:33,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:33,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:33,196 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:33,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:33,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:33,196 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 592 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 592 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:33,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:33,206 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:33,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:33,212 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 17:06:33,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:33,339 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 17:06:33,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:33,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:33,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:33,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:33,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:33,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:33,358 INFO L87 Difference]: Start difference. First operand 17 states and 31 transitions. Second operand 12 states. [2018-12-03 17:06:35,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:35,214 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:06:35,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:35,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:35,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:35,215 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:06:35,215 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:06:35,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:06:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 17:06:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:36,226 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:36,226 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:36,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:36,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:36,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:36,227 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:06:36,227 INFO L423 AbstractCegarLoop]: === Iteration 593 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:36,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:36,227 INFO L82 PathProgramCache]: Analyzing trace with hash -389498962, now seen corresponding path program 575 times [2018-12-03 17:06:36,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:36,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:36,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:36,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:36,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:36,317 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 17:06:36,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:36,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:36,318 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:36,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:36,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:36,318 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 593 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 593 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:36,326 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:36,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:36,334 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:06:36,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:36,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:36,337 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 17:06:36,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:36,502 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 17:06:36,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:36,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:36,520 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:36,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:36,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:36,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:36,520 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:38,410 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:06:38,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:38,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:38,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:38,410 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:06:38,410 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:06:38,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:06:39,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 17:06:39,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:06:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:06:39,414 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:06:39,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:39,414 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:06:39,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:06:39,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:39,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:39,414 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:06:39,414 INFO L423 AbstractCegarLoop]: === Iteration 594 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:39,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:39,415 INFO L82 PathProgramCache]: Analyzing trace with hash -389441302, now seen corresponding path program 576 times [2018-12-03 17:06:39,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:39,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:39,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:39,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:39,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:39,490 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 17:06:39,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:39,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:39,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:39,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 17:06:39,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:39,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 594 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 594 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:39,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:39,499 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:39,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:39,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:39,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:39,507 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 17:06:39,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:39,631 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 17:06:39,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:39,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:39,651 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:39,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:39,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:39,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:39,651 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:06:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:41,463 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:06:41,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:41,463 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:41,464 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:06:41,464 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:06:41,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:06:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 17:06:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:42,478 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:42,479 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:42,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:42,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:42,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:42,479 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:06:42,479 INFO L423 AbstractCegarLoop]: === Iteration 595 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:42,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash -389439380, now seen corresponding path program 577 times [2018-12-03 17:06:42,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:42,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:42,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:42,553 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 17:06:42,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:42,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:42,554 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:42,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:42,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:42,554 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 595 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 595 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:42,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:42,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:42,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:42,588 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 17:06:42,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:42,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:42,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:42,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:42,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:42,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:42,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:42,730 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:44,485 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:06:44,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:44,485 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:44,486 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:06:44,486 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:06:44,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:06:45,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 19. [2018-12-03 17:06:45,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:06:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:06:45,432 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:06:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:45,432 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:06:45,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:06:45,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:45,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:45,433 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:06:45,433 INFO L423 AbstractCegarLoop]: === Iteration 596 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:45,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:45,433 INFO L82 PathProgramCache]: Analyzing trace with hash -387653842, now seen corresponding path program 578 times [2018-12-03 17:06:45,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:45,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:45,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:45,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:45,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:45,514 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 17:06:45,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:45,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:45,514 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:45,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:45,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:45,514 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 596 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 596 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:45,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:45,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:45,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:06:45,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:45,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:45,536 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 17:06:45,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:45,671 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 17:06:45,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:45,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:45,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:45,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:45,690 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:06:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:47,576 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:06:47,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:47,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:47,577 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:06:47,577 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:06:47,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:06:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 21. [2018-12-03 17:06:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:48,590 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:48,590 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:48,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:48,590 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:48,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:48,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:48,590 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:06:48,590 INFO L423 AbstractCegarLoop]: === Iteration 597 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:48,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:48,590 INFO L82 PathProgramCache]: Analyzing trace with hash -387651920, now seen corresponding path program 579 times [2018-12-03 17:06:48,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:48,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:48,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:48,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:48,665 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 17:06:48,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:48,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:48,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:48,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:48,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:48,666 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 597 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 597 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:48,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:48,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:48,680 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:48,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:48,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:48,682 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 17:06:48,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:48,807 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 17:06:48,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:48,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:48,826 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:48,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:48,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:48,827 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:50,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:50,744 INFO L93 Difference]: Finished difference Result 36 states and 67 transitions. [2018-12-03 17:06:50,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:50,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:50,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:50,745 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:06:50,745 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:06:50,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:50,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:06:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-12-03 17:06:51,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:06:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:06:51,735 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:06:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:51,735 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:06:51,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:06:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:51,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:51,736 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:06:51,736 INFO L423 AbstractCegarLoop]: === Iteration 598 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:51,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:51,736 INFO L82 PathProgramCache]: Analyzing trace with hash -387594260, now seen corresponding path program 580 times [2018-12-03 17:06:51,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:51,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:51,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:51,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:51,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:51,812 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 17:06:51,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:51,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:51,812 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:51,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:51,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:51,812 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 598 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 598 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:51,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:51,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:51,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:51,838 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 17:06:51,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:51,963 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 17:06:51,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:51,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:51,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:51,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:51,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:51,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:51,982 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:06:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:53,754 INFO L93 Difference]: Finished difference Result 35 states and 65 transitions. [2018-12-03 17:06:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:53,754 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:53,755 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:06:53,755 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:06:53,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:06:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-12-03 17:06:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:06:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:06:54,777 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:06:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:54,777 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:06:54,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:54,778 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:06:54,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:54,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:54,778 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:06:54,778 INFO L423 AbstractCegarLoop]: === Iteration 599 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:54,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:54,778 INFO L82 PathProgramCache]: Analyzing trace with hash -387592338, now seen corresponding path program 581 times [2018-12-03 17:06:54,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:54,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:54,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:54,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:54,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:54,854 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 17:06:54,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:54,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:54,855 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:54,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:54,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:54,855 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 599 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 599 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:54,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:54,865 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:54,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:06:54,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:54,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:54,874 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 17:06:54,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:55,001 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 17:06:55,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:55,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:55,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:55,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:55,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:55,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:55,019 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:06:56,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:56,749 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:06:56,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:56,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:56,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:56,750 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:06:56,750 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:06:56,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:06:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 18. [2018-12-03 17:06:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:06:57,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2018-12-03 17:06:57,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 33 transitions. Word has length 12 [2018-12-03 17:06:57,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:57,653 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 33 transitions. [2018-12-03 17:06:57,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:06:57,653 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 33 transitions. [2018-12-03 17:06:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:06:57,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:57,653 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:06:57,653 INFO L423 AbstractCegarLoop]: === Iteration 600 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:57,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:57,653 INFO L82 PathProgramCache]: Analyzing trace with hash -332242582, now seen corresponding path program 582 times [2018-12-03 17:06:57,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:57,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:57,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:57,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:57,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:57,742 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 17:06:57,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:57,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:57,743 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:57,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:57,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:57,743 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 600 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 600 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:57,751 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:57,751 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:57,757 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:57,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:57,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:57,759 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 17:06:57,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:57,892 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 17:06:57,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:57,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:06:57,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:57,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:06:57,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:06:57,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:57,911 INFO L87 Difference]: Start difference. First operand 18 states and 33 transitions. Second operand 12 states. [2018-12-03 17:06:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:59,654 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:06:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:06:59,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:06:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:59,654 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:06:59,654 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:06:59,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:06:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:07:00,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-12-03 17:07:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:07:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:07:00,662 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:07:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:00,662 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:07:00,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:07:00,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:00,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:00,663 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:07:00,663 INFO L423 AbstractCegarLoop]: === Iteration 601 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:00,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:00,663 INFO L82 PathProgramCache]: Analyzing trace with hash -332240660, now seen corresponding path program 583 times [2018-12-03 17:07:00,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:00,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:00,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:00,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:00,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:00,739 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 17:07:00,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:00,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:00,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:00,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:00,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:00,739 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 601 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 601 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:00,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:00,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:00,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:00,755 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 17:07:00,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:00,883 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 17:07:00,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:00,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:00,903 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:00,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:00,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:00,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:00,904 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:07:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:02,572 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:07:02,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:02,573 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:02,573 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:07:02,573 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:07:02,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:02,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:07:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-12-03 17:07:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:07:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:07:03,589 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:07:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:03,589 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:07:03,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:07:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:03,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:03,589 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:07:03,589 INFO L423 AbstractCegarLoop]: === Iteration 602 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:03,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:03,589 INFO L82 PathProgramCache]: Analyzing trace with hash -332183000, now seen corresponding path program 584 times [2018-12-03 17:07:03,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:03,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:03,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:03,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:03,663 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 17:07:03,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:03,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:03,664 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:03,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:03,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:03,664 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 602 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 602 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:03,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:07:03,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:07:03,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:07:03,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:03,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:03,681 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 17:07:03,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:03,824 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 17:07:03,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:03,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:03,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:03,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:03,844 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:07:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:05,554 INFO L93 Difference]: Finished difference Result 34 states and 63 transitions. [2018-12-03 17:07:05,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:05,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:05,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:05,555 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:07:05,555 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:07:05,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:05,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:07:06,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 21. [2018-12-03 17:07:06,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:07:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:07:06,569 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:07:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:06,569 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:07:06,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:07:06,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:06,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:06,569 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:07:06,570 INFO L423 AbstractCegarLoop]: === Iteration 603 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:06,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:06,570 INFO L82 PathProgramCache]: Analyzing trace with hash -332181078, now seen corresponding path program 585 times [2018-12-03 17:07:06,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:06,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:06,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:06,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:06,570 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:06,828 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 17:07:06,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:06,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:06,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:06,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:06,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:06,829 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 603 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 603 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:06,838 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:06,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:06,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:06,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:06,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:06,846 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 17:07:06,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:06,964 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 17:07:06,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:06,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:06,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:06,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:06,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:06,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:06,984 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:07:08,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:08,646 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:07:08,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:08,646 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:08,647 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:07:08,647 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:07:08,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 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 17:07:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:07:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 17:07:09,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:07:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:07:09,606 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:07:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:09,606 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:07:09,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:07:09,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:09,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:09,606 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:07:09,606 INFO L423 AbstractCegarLoop]: === Iteration 604 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:09,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash -330395540, now seen corresponding path program 586 times [2018-12-03 17:07:09,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:09,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:09,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:09,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:09,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:09,788 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 17:07:09,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:09,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:09,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:09,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:09,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:09,789 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 604 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 604 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:09,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:09,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:09,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:09,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 17:07:09,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:09,917 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 17:07:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:09,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:09,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:09,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:09,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:09,936 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:07:11,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:11,597 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:07:11,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:11,597 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:11,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:11,597 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:07:11,597 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:07:11,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:07:12,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 21. [2018-12-03 17:07:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:07:12,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:07:12,625 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:07:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:12,625 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:07:12,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:12,625 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:07:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:12,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:12,625 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:07:12,625 INFO L423 AbstractCegarLoop]: === Iteration 605 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:12,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:12,626 INFO L82 PathProgramCache]: Analyzing trace with hash -330393618, now seen corresponding path program 587 times [2018-12-03 17:07:12,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:12,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:12,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:12,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:12,729 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 17:07:12,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:12,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:12,730 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:12,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:12,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:12,730 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 605 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 605 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:12,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:07:12,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:07:12,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:07:12,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:12,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:12,749 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 17:07:12,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:12,889 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 17:07:12,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:12,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:12,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:12,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:12,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:12,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:12,908 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:07:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:14,537 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:07:14,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:14,537 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:14,538 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:07:14,538 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:07:14,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:07:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 17:07:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:07:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:07:15,564 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:07:15,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:15,564 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:07:15,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:15,564 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:07:15,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:15,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:15,565 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:07:15,565 INFO L423 AbstractCegarLoop]: === Iteration 606 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:15,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:15,565 INFO L82 PathProgramCache]: Analyzing trace with hash -330335958, now seen corresponding path program 588 times [2018-12-03 17:07:15,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:15,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:15,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:15,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:15,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:15,649 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 17:07:15,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:15,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:15,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:15,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:15,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:15,650 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 606 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 606 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:15,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:15,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:15,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:15,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:15,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:15,668 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 17:07:15,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:15,792 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 17:07:15,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:15,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:15,812 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:15,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:15,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:15,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:15,812 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:07:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:17,350 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:07:17,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:17,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:17,350 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:07:17,350 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:07:17,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:07:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-12-03 17:07:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:07:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:07:18,373 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:07:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:18,373 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:07:18,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:07:18,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:18,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:18,373 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:07:18,373 INFO L423 AbstractCegarLoop]: === Iteration 607 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:18,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash -330334036, now seen corresponding path program 589 times [2018-12-03 17:07:18,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:18,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:18,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:18,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:18,452 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 17:07:18,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:18,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:18,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:18,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:18,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:18,453 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 607 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 607 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:18,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:18,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:18,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:18,468 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 17:07:18,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:18,607 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 17:07:18,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:18,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:18,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:18,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:18,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:18,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:18,626 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:07:20,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:20,102 INFO L93 Difference]: Finished difference Result 30 states and 55 transitions. [2018-12-03 17:07:20,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:20,102 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:20,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:20,103 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:07:20,103 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:07:20,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:07:20,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2018-12-03 17:07:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:07:20,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2018-12-03 17:07:20,852 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 12 [2018-12-03 17:07:20,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:20,852 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2018-12-03 17:07:20,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:20,852 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2018-12-03 17:07:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:20,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:20,852 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 1, 1, 1] [2018-12-03 17:07:20,853 INFO L423 AbstractCegarLoop]: === Iteration 608 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:20,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1321112424, now seen corresponding path program 590 times [2018-12-03 17:07:20,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:20,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:20,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:20,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:20,927 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 17:07:20,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:20,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:20,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:20,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:20,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:20,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 608 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 608 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:20,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:07:20,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:07:20,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:07:20,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:20,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:20,947 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 17:07:20,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:21,097 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 17:07:21,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:21,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:21,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:21,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:21,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:21,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:21,117 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 12 states. [2018-12-03 17:07:22,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:22,785 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:07:22,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:22,785 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:22,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:22,786 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:07:22,786 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:07:22,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:22,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:07:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-12-03 17:07:23,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:07:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:07:23,832 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:07:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:23,833 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:07:23,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:07:23,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:23,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:23,833 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:07:23,833 INFO L423 AbstractCegarLoop]: === Iteration 609 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:23,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:23,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1321114346, now seen corresponding path program 591 times [2018-12-03 17:07:23,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:23,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:23,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:23,834 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:23,910 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 17:07:23,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:23,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:23,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:23,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:23,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:23,911 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 609 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 609 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:23,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:23,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:23,925 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:23,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:23,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:23,928 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 17:07:23,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:24,066 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 17:07:24,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:24,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:24,085 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:24,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:24,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:24,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:24,085 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:07:25,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:25,702 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:07:25,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:25,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:25,702 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:07:25,702 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:07:25,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:07:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 20. [2018-12-03 17:07:26,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:07:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2018-12-03 17:07:26,733 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 12 [2018-12-03 17:07:26,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:26,733 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2018-12-03 17:07:26,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2018-12-03 17:07:26,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:26,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:26,733 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:07:26,733 INFO L423 AbstractCegarLoop]: === Iteration 610 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:26,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1321172006, now seen corresponding path program 592 times [2018-12-03 17:07:26,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:26,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:26,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:26,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:26,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:26,979 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 17:07:26,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:26,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:26,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:26,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:26,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:26,980 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 610 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 610 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:26,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:26,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:26,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:26,996 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 17:07:26,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:27,112 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 17:07:27,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:27,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:27,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:27,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:27,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:27,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:27,131 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 12 states. [2018-12-03 17:07:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:28,799 INFO L93 Difference]: Finished difference Result 33 states and 61 transitions. [2018-12-03 17:07:28,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:28,799 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:28,799 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:07:28,799 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:07:28,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 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 17:07:28,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:07:29,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2018-12-03 17:07:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:07:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2018-12-03 17:07:29,840 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 39 transitions. Word has length 12 [2018-12-03 17:07:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:29,840 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 39 transitions. [2018-12-03 17:07:29,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 39 transitions. [2018-12-03 17:07:29,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:29,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:29,840 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 17:07:29,840 INFO L423 AbstractCegarLoop]: === Iteration 611 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:29,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:29,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1321173928, now seen corresponding path program 593 times [2018-12-03 17:07:29,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:29,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:29,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:29,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:29,913 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 17:07:29,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:29,914 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:29,914 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:29,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:29,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:29,914 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 611 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 611 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:29,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:07:29,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:07:29,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:07:29,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:29,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:29,934 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 17:07:29,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:30,065 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 17:07:30,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:30,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:30,083 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:30,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:30,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:30,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:30,084 INFO L87 Difference]: Start difference. First operand 21 states and 39 transitions. Second operand 12 states. [2018-12-03 17:07:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:31,683 INFO L93 Difference]: Finished difference Result 32 states and 59 transitions. [2018-12-03 17:07:31,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:31,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:31,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:31,683 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:07:31,683 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:07:31,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:31,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:07:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 19. [2018-12-03 17:07:32,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:07:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 35 transitions. [2018-12-03 17:07:32,661 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 35 transitions. Word has length 12 [2018-12-03 17:07:32,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:32,661 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 35 transitions. [2018-12-03 17:07:32,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:07:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 35 transitions. [2018-12-03 17:07:32,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:07:32,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:32,662 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 1, 1, 1] [2018-12-03 17:07:32,662 INFO L423 AbstractCegarLoop]: === Iteration 612 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:32,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:32,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1322959466, now seen corresponding path program 594 times [2018-12-03 17:07:32,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:32,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:32,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:32,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:32,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:32,738 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 17:07:32,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:32,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:32,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:32,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:32,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:32,739 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 612 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 612 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:32,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:32,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:32,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:32,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:32,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:32,755 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 17:07:32,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:32,884 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 17:07:32,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:32,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:07:32,902 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:32,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:07:32,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:07:32,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:32,902 INFO L87 Difference]: Start difference. First operand 19 states and 35 transitions. Second operand 12 states. [2018-12-03 17:07:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:34,436 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2018-12-03 17:07:34,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:07:34,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:07:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:34,436 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:07:34,436 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:07:34,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:07:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states.