java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LexIndexValue-Pointer-Reduced.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:49:33,062 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:49:33,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:49:33,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:49:33,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:49:33,085 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:49:33,087 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:49:33,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:49:33,091 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:49:33,093 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:49:33,095 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:49:33,095 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:49:33,096 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:49:33,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:49:33,100 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:49:33,107 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:49:33,108 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:49:33,113 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:49:33,115 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:49:33,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:49:33,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:49:33,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:49:33,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:49:33,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:49:33,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:49:33,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:49:33,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:49:33,130 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:49:33,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:49:33,133 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:49:33,133 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:49:33,135 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:49:33,135 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:49:33,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:49:33,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:49:33,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:49:33,138 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:49:33,158 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:49:33,159 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:49:33,160 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:49:33,160 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:49:33,160 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:49:33,161 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:49:33,161 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:49:33,161 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:49:33,161 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:49:33,161 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:49:33,162 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:49:33,162 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:49:33,162 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:49:33,162 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:49:33,162 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:49:33,163 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:49:33,163 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:49:33,163 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:49:33,164 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:49:33,164 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:49:33,164 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:49:33,164 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:49:33,165 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:49:33,165 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:49:33,165 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:49:33,165 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:49:33,165 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:49:33,166 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:49:33,166 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:49:33,166 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:49:33,166 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:49:33,166 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:49:33,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:49:33,167 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:49:33,167 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:49:33,167 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:49:33,167 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:49:33,168 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:49:33,168 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:49:33,168 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:49:33,168 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:49:33,201 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:49:33,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:49:33,221 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:49:33,223 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:49:33,224 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:49:33,224 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LexIndexValue-Pointer-Reduced.bpl [2018-12-03 15:49:33,225 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LexIndexValue-Pointer-Reduced.bpl' [2018-12-03 15:49:33,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:49:33,266 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:49:33,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:49:33,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:49:33,267 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:49:33,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... [2018-12-03 15:49:33,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... [2018-12-03 15:49:33,302 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:49:33,302 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:49:33,303 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:49:33,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:49:33,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:49:33,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:49:33,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:49:33,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... [2018-12-03 15:49:33,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... [2018-12-03 15:49:33,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... [2018-12-03 15:49:33,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... [2018-12-03 15:49:33,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... [2018-12-03 15:49:33,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... [2018-12-03 15:49:33,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... [2018-12-03 15:49:33,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:49:33,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:49:33,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:49:33,329 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:49:33,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:49:33,398 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:49:33,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:49:33,560 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:49:33,561 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:49:33,561 INFO L202 PluginConnector]: Adding new model LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:49:33 BoogieIcfgContainer [2018-12-03 15:49:33,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:49:33,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:49:33,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:49:33,566 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:49:33,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:49:33" (1/2) ... [2018-12-03 15:49:33,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c25b842 and model type LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:49:33, skipping insertion in model container [2018-12-03 15:49:33,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:49:33" (2/2) ... [2018-12-03 15:49:33,569 INFO L112 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Pointer-Reduced.bpl [2018-12-03 15:49:33,579 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:49:33,587 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:49:33,605 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:49:33,638 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:49:33,638 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:49:33,639 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:49:33,639 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:49:33,639 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:49:33,639 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:49:33,639 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:49:33,640 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:49:33,655 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:49:33,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:49:33,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:33,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:49:33,664 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:33,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:33,671 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-12-03 15:49:33,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:33,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:33,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:33,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:33,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:33,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:49:33,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 15:49:33,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:49:33,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:49:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:49:33,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:49:33,846 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:49:33,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:33,932 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:49:33,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:49:33,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:49:33,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:33,946 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:49:33,947 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:49:33,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:49:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:49:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:49:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:49:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:49:34,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-12-03 15:49:34,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:34,029 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:49:34,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:49:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:49:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:49:34,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:34,036 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:49:34,036 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:34,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:34,037 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-12-03 15:49:34,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:34,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:34,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:34,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:34,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:34,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:34,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:34,136 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 15:49:34,138 INFO L205 CegarAbsIntRunner]: [0], [4], [5], [6] [2018-12-03 15:49:34,171 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:49:34,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:49:34,309 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:49:34,311 INFO L272 AbstractInterpreter]: Visited 4 different actions 16 times. Merged at 3 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:49:34,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:34,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:49:34,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:34,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:34,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:34,337 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:34,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:34,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:34,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:34,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-03 15:49:34,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:34,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:49:34,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:49:34,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:49:34,782 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 15:49:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:34,837 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:49:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:49:34,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 15:49:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:34,838 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:49:34,838 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:49:34,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:49:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:49:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:49:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:49:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:49:34,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-03 15:49:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:34,842 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:49:34,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:49:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:49:34,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:49:34,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:34,843 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-12-03 15:49:34,844 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:34,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:34,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-12-03 15:49:34,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:34,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:34,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:34,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:34,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:34,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:34,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:34,924 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:34,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:34,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:34,924 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:34,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:34,935 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:34,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:49:34,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:34,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:35,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-03 15:49:35,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:35,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:49:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:49:35,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:35,424 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 15:49:35,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:35,489 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:49:35,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:49:35,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 15:49:35,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:35,492 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:49:35,492 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:49:35,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:49:35,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:49:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:49:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:49:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:49:35,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-03 15:49:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:35,501 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:49:35,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:49:35,502 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:49:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:49:35,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:35,502 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-12-03 15:49:35,503 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:35,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-12-03 15:49:35,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:35,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:35,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:35,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:35,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:35,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:35,580 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:35,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:35,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:35,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:35,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:35,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:35,618 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:35,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:35,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:35,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-03 15:49:35,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:35,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:49:35,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:49:35,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:49:35,865 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 15:49:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:35,922 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:49:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:49:35,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 15:49:35,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:35,923 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:49:35,924 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:49:35,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:49:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:49:35,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:49:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:49:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:49:35,928 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-03 15:49:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:35,928 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:49:35,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:49:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:49:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:49:35,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:35,929 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-12-03 15:49:35,929 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:35,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:35,930 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-12-03 15:49:35,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:35,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:35,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,097 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:36,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:36,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:36,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 15:49:36,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:36,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:36,108 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:36,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:36,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:36,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-03 15:49:36,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:36,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:49:36,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:49:36,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:49:36,676 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 15:49:36,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:36,743 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:49:36,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:49:36,744 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 15:49:36,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:36,745 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:49:36,745 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:49:36,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:49:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:49:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:49:36,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:49:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:49:36,751 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-03 15:49:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:36,751 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:49:36,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:49:36,752 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:49:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:49:36,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:36,752 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-12-03 15:49:36,753 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:36,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:36,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-12-03 15:49:36,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:36,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:36,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:36,756 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:36,904 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:36,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:36,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:36,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:36,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:36,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:36,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:36,916 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:36,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:49:36,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:36,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:37,180 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:37,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-03 15:49:37,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:37,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:49:37,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:49:37,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:49:37,202 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 15:49:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:37,292 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:49:37,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:49:37,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 15:49:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:37,295 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:49:37,295 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:49:37,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:49:37,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:49:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:49:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:49:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:49:37,299 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-03 15:49:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:37,300 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:49:37,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:49:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:49:37,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:49:37,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:37,301 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-12-03 15:49:37,301 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:37,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:37,301 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-12-03 15:49:37,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:37,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:37,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:37,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:37,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:37,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:37,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:37,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:37,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:37,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:37,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:37,598 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:37,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-03 15:49:37,744 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:37,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:49:37,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:49:37,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:49:37,745 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 15:49:37,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:37,832 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 15:49:37,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:49:37,833 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 15:49:37,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:37,834 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:49:37,834 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:49:37,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:49:37,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:49:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:49:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:49:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:49:37,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-03 15:49:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:37,840 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:49:37,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:49:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:49:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:49:37,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:37,841 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-12-03 15:49:37,842 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:37,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:37,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-12-03 15:49:37,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:37,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:37,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:37,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:37,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:37,943 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:37,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 15:49:37,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:37,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:37,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:37,953 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:37,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:38,123 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:38,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:38,294 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:38,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:38,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-03 15:49:38,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:38,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:49:38,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:49:38,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:49:38,316 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 15:49:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:38,366 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:49:38,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:49:38,366 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 15:49:38,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:38,368 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:49:38,368 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:49:38,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:49:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:49:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:49:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:49:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:49:38,373 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-03 15:49:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:38,373 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:49:38,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:49:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:49:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:49:38,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:38,374 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-12-03 15:49:38,375 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:38,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:38,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-12-03 15:49:38,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:38,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:38,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:38,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:38,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:38,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:38,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:38,664 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:38,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 15:49:38,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:38,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:38,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:38,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:38,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 15:49:38,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:38,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:38,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:38,998 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:39,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:39,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-03 15:49:39,019 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:39,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:49:39,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:49:39,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:49:39,021 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 15:49:39,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:39,083 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 15:49:39,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:49:39,084 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 15:49:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:39,085 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:49:39,086 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:49:39,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:49:39,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:49:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:49:39,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:49:39,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:49:39,091 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-12-03 15:49:39,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:39,091 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:49:39,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:49:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:49:39,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:49:39,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:39,092 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-12-03 15:49:39,092 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:39,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:39,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-12-03 15:49:39,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:39,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:39,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:39,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:39,250 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:39,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:39,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:39,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:39,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:39,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:39,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:39,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:39,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:39,278 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:39,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:39,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:39,535 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:39,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:39,988 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:40,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:40,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-03 15:49:40,008 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:40,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:49:40,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:49:40,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:49:40,010 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 15:49:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:40,257 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:49:40,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:49:40,258 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 15:49:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:40,258 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:49:40,259 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:49:40,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:49:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:49:40,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:49:40,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:49:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:49:40,263 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-12-03 15:49:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:40,264 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:49:40,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:49:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:49:40,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:49:40,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:40,265 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-12-03 15:49:40,265 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:40,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:40,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-12-03 15:49:40,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:40,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:40,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:40,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:40,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:40,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:40,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:40,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:40,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:40,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:40,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:40,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:40,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:40,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:40,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:41,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:41,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-03 15:49:41,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:41,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:49:41,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:49:41,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:49:41,152 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 15:49:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:41,222 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 15:49:41,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:49:41,222 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 15:49:41,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:41,223 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:49:41,224 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:49:41,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:49:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:49:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:49:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:49:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:49:41,229 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-12-03 15:49:41,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:41,231 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:49:41,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:49:41,231 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:49:41,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:49:41,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:41,232 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-12-03 15:49:41,232 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:41,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:41,234 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-12-03 15:49:41,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:41,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:41,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:41,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:41,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:41,421 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:41,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:41,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:41,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:41,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 15:49:41,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:41,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:41,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:41,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:41,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:49:41,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:41,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:41,883 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:41,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:42,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:42,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-03 15:49:42,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:42,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:49:42,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:49:42,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:49:42,179 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 15:49:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:42,248 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:49:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:49:42,248 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 15:49:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:42,249 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:49:42,249 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:49:42,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:49:42,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:49:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:49:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:49:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:49:42,254 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-12-03 15:49:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:42,254 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:49:42,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:49:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:49:42,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:49:42,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:42,255 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-12-03 15:49:42,255 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:42,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:42,256 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-12-03 15:49:42,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:42,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:42,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:42,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:42,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:42,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:42,556 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:42,556 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:42,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 15:49:42,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:42,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:42,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:42,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:42,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:42,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:42,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:42,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:42,986 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:43,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:43,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-03 15:49:43,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:43,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:49:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:49:43,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:49:43,006 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 15:49:43,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:43,093 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 15:49:43,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:49:43,094 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 15:49:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:43,094 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:49:43,094 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:49:43,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:49:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:49:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:49:43,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:49:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:49:43,100 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-12-03 15:49:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:43,100 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:49:43,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:49:43,101 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:49:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:49:43,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:43,102 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-12-03 15:49:43,102 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:43,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-12-03 15:49:43,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:43,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:43,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:43,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:43,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:43,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:43,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:43,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:43,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 15:49:43,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:43,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:43,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:43,336 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:43,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:43,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:44,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:44,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-03 15:49:44,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:44,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:49:44,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:49:44,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:49:44,571 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 15:49:44,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:44,646 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:49:44,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:49:44,647 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 15:49:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:44,648 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:49:44,648 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:49:44,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:49:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:49:44,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:49:44,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:49:44,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:49:44,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-12-03 15:49:44,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:44,654 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:49:44,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:49:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:49:44,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:49:44,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:44,655 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-12-03 15:49:44,655 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:44,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:44,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-12-03 15:49:44,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:44,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:44,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:44,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:44,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:44,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:44,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:44,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:44,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:44,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:44,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:44,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:44,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 15:49:44,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:44,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:45,559 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:45,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:46,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:46,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-03 15:49:46,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:46,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:49:46,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:49:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:49:46,068 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 15:49:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:46,244 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 15:49:46,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:49:46,244 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 15:49:46,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:46,245 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:49:46,246 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:49:46,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:49:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:49:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:49:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:49:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 15:49:46,251 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-12-03 15:49:46,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:46,252 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 15:49:46,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:49:46,252 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 15:49:46,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:49:46,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:46,253 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-12-03 15:49:46,253 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:46,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-12-03 15:49:46,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:46,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:46,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:46,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:46,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:46,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:46,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 15:49:46,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:46,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:46,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:46,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:46,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:46,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:46,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:47,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:47,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:47,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-03 15:49:47,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:47,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:49:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:49:47,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:49:47,634 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 15:49:47,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:47,720 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 15:49:47,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:49:47,721 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 15:49:47,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:47,721 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:49:47,722 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:49:47,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:49:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:49:47,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:49:47,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:49:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 15:49:47,728 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-12-03 15:49:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:47,728 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 15:49:47,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:49:47,728 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 15:49:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:49:47,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:47,729 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-12-03 15:49:47,729 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:47,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:47,729 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-12-03 15:49:47,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:47,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:47,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:47,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:47,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:48,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:48,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:48,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:48,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:48,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:48,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:48,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:48,192 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:48,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:48,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:49,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:49,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-03 15:49:49,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:49,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:49:49,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:49:49,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:49:49,231 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-12-03 15:49:49,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:49,311 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 15:49:49,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:49:49,312 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-12-03 15:49:49,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:49,312 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:49:49,313 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 15:49:49,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:49:49,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 15:49:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 15:49:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:49:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 15:49:49,318 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-03 15:49:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:49,319 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 15:49:49,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:49:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 15:49:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:49:49,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:49,320 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-12-03 15:49:49,320 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:49,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:49,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-12-03 15:49:49,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:49,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:49,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:49,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:49,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:49,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:49,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:49,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:49,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:49,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:49,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:49,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:49,728 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:49,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:49:49,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:49,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:50,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:50,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:50,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-03 15:49:50,425 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:50,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:49:50,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:49:50,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:49:50,427 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-12-03 15:49:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:50,668 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 15:49:50,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:49:50,669 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-12-03 15:49:50,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:50,669 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:49:50,670 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:49:50,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:49:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:49:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:49:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:49:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 15:49:50,676 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-03 15:49:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:50,677 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 15:49:50,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:49:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 15:49:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:49:50,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:50,678 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-12-03 15:49:50,678 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:50,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-12-03 15:49:50,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:50,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:50,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:50,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:50,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:50,930 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:50,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:50,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:50,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:50,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 15:49:50,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:50,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:50,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:50,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:50,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:50,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:50,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:51,272 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:51,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:51,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:51,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-03 15:49:51,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:51,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:49:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:49:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:49:51,897 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-12-03 15:49:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:52,042 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 15:49:52,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:49:52,043 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-12-03 15:49:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:52,043 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:49:52,043 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:49:52,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:49:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:49:52,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:49:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:49:52,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 15:49:52,048 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-03 15:49:52,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:52,048 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 15:49:52,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:49:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 15:49:52,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:49:52,049 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:52,050 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-12-03 15:49:52,050 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:52,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-12-03 15:49:52,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:52,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:52,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:52,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:52,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:52,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:52,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:52,312 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:52,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 15:49:52,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:52,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:52,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:52,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:52,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:52,636 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:52,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:53,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:53,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-03 15:49:53,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:53,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:49:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:49:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:49:53,400 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-12-03 15:49:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:53,502 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 15:49:53,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:49:53,502 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-12-03 15:49:53,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:53,503 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:49:53,503 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:49:53,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:49:53,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:49:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:49:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:49:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 15:49:53,511 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-03 15:49:53,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:53,511 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 15:49:53,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:49:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 15:49:53,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:49:53,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:53,512 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-12-03 15:49:53,513 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:53,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:53,513 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-12-03 15:49:53,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:53,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:53,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:53,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:53,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:53,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:53,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:53,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 15:49:53,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:53,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:53,866 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:53,866 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:53,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 15:49:53,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:53,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:54,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:55,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:55,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-03 15:49:55,038 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:55,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:49:55,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:49:55,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:49:55,040 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-12-03 15:49:55,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:55,128 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 15:49:55,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:49:55,129 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-12-03 15:49:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:55,130 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:49:55,130 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:49:55,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:49:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:49:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:49:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:49:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 15:49:55,137 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-12-03 15:49:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:55,137 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 15:49:55,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:49:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 15:49:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:49:55,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:55,138 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-12-03 15:49:55,139 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:55,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:55,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-12-03 15:49:55,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:55,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:55,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:55,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:55,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:55,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:55,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:55,933 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:55,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:55,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:55,933 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:55,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:55,942 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:55,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:55,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:55,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:56,333 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:56,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:56,937 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:56,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:56,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-03 15:49:56,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:56,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:49:56,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:49:56,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:49:56,958 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-12-03 15:49:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:57,047 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 15:49:57,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:49:57,050 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-12-03 15:49:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:57,051 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:49:57,051 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 15:49:57,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:49:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 15:49:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 15:49:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:49:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 15:49:57,056 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-12-03 15:49:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:57,056 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 15:49:57,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:49:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 15:49:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:49:57,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:57,057 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-12-03 15:49:57,058 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:57,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-12-03 15:49:57,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:57,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:57,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:57,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:57,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:57,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:57,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:57,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:57,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:57,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:57,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:49:57,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:57,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:57,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:59,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:59,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:59,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-03 15:49:59,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:59,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:49:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:49:59,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:49:59,925 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-12-03 15:50:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:00,031 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 15:50:00,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:50:00,031 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-12-03 15:50:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:00,032 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:50:00,033 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:50:00,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:50:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:50:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:50:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:50:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 15:50:00,038 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-12-03 15:50:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:00,039 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 15:50:00,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:50:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 15:50:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:50:00,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:00,040 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-12-03 15:50:00,040 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:00,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:00,040 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-12-03 15:50:00,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:00,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:00,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:00,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:00,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:00,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:00,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:00,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:00,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:00,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:00,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:00,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:00,459 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:00,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:50:00,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:00,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:00,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:01,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:01,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-03 15:50:01,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:01,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:50:01,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:50:01,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:50:01,608 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-12-03 15:50:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:01,755 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 15:50:01,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:50:01,755 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-12-03 15:50:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:01,756 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:50:01,756 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:50:01,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:50:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:50:01,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:50:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:50:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 15:50:01,762 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-12-03 15:50:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:01,762 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 15:50:01,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:50:01,763 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 15:50:01,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:50:01,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:01,763 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-12-03 15:50:01,764 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:01,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:01,764 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-12-03 15:50:01,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:01,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:01,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:01,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:01,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:02,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:02,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:02,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:02,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:02,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:02,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:02,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:02,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:02,266 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:02,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:02,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:02,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:03,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:03,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-03 15:50:03,573 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:03,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:50:03,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:50:03,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:50:03,574 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-12-03 15:50:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:03,693 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 15:50:03,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:50:03,694 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-12-03 15:50:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:03,695 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:50:03,695 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:50:03,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:50:03,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:50:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 15:50:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:50:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 15:50:03,700 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-12-03 15:50:03,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:03,701 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 15:50:03,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:50:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 15:50:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:50:03,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:03,702 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-12-03 15:50:03,702 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:03,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-12-03 15:50:03,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:03,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:03,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:03,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:03,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:04,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:04,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:04,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:04,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 15:50:04,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:04,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:04,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:04,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:04,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:04,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:06,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:06,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-03 15:50:06,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:06,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:50:06,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:50:06,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:50:06,055 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-12-03 15:50:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:06,279 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 15:50:06,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:50:06,280 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-12-03 15:50:06,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:06,281 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:50:06,281 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 15:50:06,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:50:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 15:50:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 15:50:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:50:06,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 15:50:06,287 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-12-03 15:50:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:06,287 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 15:50:06,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:50:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 15:50:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:50:06,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:06,288 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-12-03 15:50:06,288 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:06,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:06,289 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-12-03 15:50:06,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:06,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:06,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:06,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:06,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:06,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:06,845 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:06,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:06,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:06,845 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:06,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:06,854 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:06,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 15:50:06,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:06,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:07,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:08,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:08,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-03 15:50:08,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:08,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:50:08,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:50:08,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:50:08,230 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-12-03 15:50:08,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:08,342 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 15:50:08,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:50:08,342 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-12-03 15:50:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:08,343 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:50:08,343 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:50:08,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 15:50:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:50:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:50:08,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:50:08,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 15:50:08,348 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-12-03 15:50:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:08,348 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 15:50:08,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:50:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 15:50:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:50:08,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:08,349 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-12-03 15:50:08,349 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:08,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:08,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-12-03 15:50:08,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:08,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:08,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:08,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:08,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:09,155 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:09,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:09,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:09,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:09,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 15:50:09,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:09,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:09,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:09,166 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:09,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:09,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:09,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:09,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:10,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:10,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-03 15:50:10,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:10,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:50:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:50:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:50:10,891 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-12-03 15:50:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:11,047 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 15:50:11,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:50:11,050 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-12-03 15:50:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:11,051 INFO L225 Difference]: With dead ends: 61 [2018-12-03 15:50:11,051 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 15:50:11,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:50:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 15:50:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 15:50:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:50:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 15:50:11,055 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-12-03 15:50:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:11,055 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 15:50:11,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:50:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 15:50:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:50:11,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:11,056 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-12-03 15:50:11,056 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:11,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:11,057 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-12-03 15:50:11,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:11,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:11,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:11,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:11,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:11,540 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:11,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:11,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:11,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:11,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:11,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:11,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:11,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:11,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:11,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:12,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:13,174 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:13,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:13,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-03 15:50:13,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:13,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:50:13,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:50:13,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:50:13,193 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-12-03 15:50:13,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:13,403 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 15:50:13,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:50:13,403 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-12-03 15:50:13,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:13,404 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:50:13,404 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:50:13,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:50:13,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:50:13,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 15:50:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:50:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 15:50:13,409 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-12-03 15:50:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:13,409 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 15:50:13,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:50:13,409 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 15:50:13,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 15:50:13,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:13,410 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-12-03 15:50:13,410 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:13,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:13,411 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-12-03 15:50:13,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:13,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:13,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:13,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:13,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:13,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:13,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:13,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:13,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 15:50:13,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:13,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:13,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:13,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:13,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 15:50:13,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:13,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:14,806 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:14,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:15,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:15,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-03 15:50:15,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:15,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:50:15,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:50:15,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:50:15,883 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-12-03 15:50:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:16,022 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 15:50:16,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:50:16,022 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-12-03 15:50:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:16,023 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:50:16,024 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:50:16,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:50:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:50:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 15:50:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:50:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 15:50:16,029 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-12-03 15:50:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:16,029 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 15:50:16,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:50:16,029 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 15:50:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:50:16,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:16,030 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-12-03 15:50:16,030 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:16,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:16,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-12-03 15:50:16,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:16,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:16,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:16,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:16,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:16,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:16,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:16,625 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:16,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:16,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:16,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:16,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:16,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:16,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:16,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:16,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:17,293 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:17,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:18,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:18,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-03 15:50:18,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:18,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:50:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:50:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:50:18,656 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-12-03 15:50:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:18,799 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 15:50:18,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:50:18,799 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-12-03 15:50:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:18,801 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:50:18,801 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 15:50:18,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:50:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 15:50:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 15:50:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:50:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 15:50:18,805 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-12-03 15:50:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:18,806 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 15:50:18,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:50:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 15:50:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:50:18,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:18,806 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-12-03 15:50:18,807 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:18,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-12-03 15:50:18,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:18,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:18,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:19,637 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:19,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:19,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:19,638 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:19,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:19,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:19,638 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:19,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:19,648 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:19,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:20,436 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:20,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:21,636 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:21,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:21,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-03 15:50:21,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:21,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:50:21,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:50:21,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:50:21,658 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-12-03 15:50:21,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:21,815 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 15:50:21,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:50:21,815 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-12-03 15:50:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:21,816 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:50:21,817 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:50:21,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:50:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:50:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:50:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:50:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 15:50:21,821 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-12-03 15:50:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:21,821 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 15:50:21,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:50:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 15:50:21,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:50:21,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:21,822 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-12-03 15:50:21,822 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:21,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:21,822 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-12-03 15:50:21,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:21,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:21,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:21,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:22,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:22,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:22,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:22,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 15:50:22,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:22,511 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:22,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:22,519 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:22,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 15:50:22,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:22,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:23,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:25,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:25,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-03 15:50:25,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:25,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:50:25,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:50:25,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:50:25,154 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-12-03 15:50:25,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:25,286 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 15:50:25,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:50:25,286 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-12-03 15:50:25,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:25,287 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:50:25,287 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:50:25,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:50:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:50:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 15:50:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:50:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 15:50:25,293 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-12-03 15:50:25,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:25,293 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 15:50:25,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:50:25,293 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 15:50:25,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:50:25,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:25,294 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-12-03 15:50:25,294 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:25,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:25,295 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-12-03 15:50:25,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:25,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:25,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:25,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:25,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:25,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:25,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:25,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:25,925 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:25,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:25,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:25,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:25,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:25,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:25,953 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:25,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:25,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:26,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:28,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:28,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:28,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-03 15:50:28,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:28,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:50:28,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:50:28,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:50:28,143 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-12-03 15:50:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:28,314 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 15:50:28,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:50:28,314 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-12-03 15:50:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:28,315 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:50:28,316 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 15:50:28,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:50:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 15:50:28,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 15:50:28,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:50:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 15:50:28,320 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-12-03 15:50:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:28,320 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 15:50:28,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:50:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 15:50:28,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:50:28,321 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:28,321 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-12-03 15:50:28,321 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:28,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-12-03 15:50:28,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:28,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:28,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:28,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:28,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:28,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:28,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:28,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:28,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:28,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:28,971 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:28,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:29,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:31,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:31,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:31,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-03 15:50:31,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:31,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:50:31,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:50:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:50:31,502 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-12-03 15:50:31,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:31,651 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 15:50:31,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:50:31,652 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-12-03 15:50:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:31,653 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:50:31,653 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:50:31,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:50:31,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:50:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:50:31,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:50:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 15:50:31,659 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-12-03 15:50:31,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:31,659 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 15:50:31,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:50:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 15:50:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:50:31,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:31,660 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-12-03 15:50:31,660 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:31,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:31,660 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-12-03 15:50:31,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:31,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:31,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:31,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:31,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:32,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:32,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:32,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:32,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:32,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:32,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:32,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:32,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:32,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 15:50:32,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:32,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:33,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:35,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:35,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-03 15:50:35,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:35,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:50:35,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:50:35,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:50:35,291 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-12-03 15:50:35,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:35,653 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 15:50:35,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:50:35,654 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-12-03 15:50:35,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:35,655 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:50:35,655 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:50:35,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:50:35,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:50:35,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:50:35,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:50:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 15:50:35,660 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-12-03 15:50:35,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:35,660 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 15:50:35,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:50:35,660 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 15:50:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:50:35,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:35,661 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-12-03 15:50:35,661 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:35,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-12-03 15:50:35,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:35,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:35,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:35,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:35,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:35,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:36,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:36,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:36,308 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:36,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:36,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:36,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:36,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:36,317 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:36,338 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:36,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:36,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:37,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:38,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:38,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-03 15:50:38,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:38,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:50:38,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:50:38,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:50:38,794 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-12-03 15:50:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:38,942 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 15:50:38,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:50:38,943 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-12-03 15:50:38,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:38,943 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:50:38,944 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 15:50:38,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:50:38,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 15:50:38,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 15:50:38,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:50:38,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 15:50:38,948 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-12-03 15:50:38,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:38,948 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 15:50:38,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:50:38,949 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 15:50:38,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 15:50:38,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:38,949 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-12-03 15:50:38,949 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:38,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:38,950 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-12-03 15:50:38,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:38,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:38,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:38,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:38,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:40,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:40,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:40,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:40,372 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:40,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:40,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:40,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:40,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:40,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:40,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:41,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:43,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:43,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-03 15:50:43,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:43,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:50:43,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:50:43,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:50:43,221 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-12-03 15:50:43,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:43,380 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 15:50:43,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:50:43,380 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-12-03 15:50:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:43,381 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:50:43,382 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 15:50:43,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:50:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 15:50:43,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 15:50:43,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:50:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 15:50:43,386 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-12-03 15:50:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:43,386 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 15:50:43,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:50:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 15:50:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 15:50:43,387 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:43,387 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-12-03 15:50:43,387 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:43,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:43,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-12-03 15:50:43,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:43,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:43,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:43,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:43,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:44,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:44,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:44,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:44,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:44,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:44,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:44,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:44,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:44,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:44,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 15:50:44,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:44,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:45,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:47,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:47,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-03 15:50:47,357 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:47,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:50:47,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:50:47,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:50:47,359 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-12-03 15:50:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:47,569 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 15:50:47,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:50:47,569 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-12-03 15:50:47,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:47,571 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:50:47,571 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:50:47,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:50:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:50:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:50:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:50:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 15:50:47,585 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-12-03 15:50:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:47,585 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 15:50:47,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:50:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 15:50:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:50:47,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:47,586 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-12-03 15:50:47,586 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:47,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-12-03 15:50:47,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:47,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:47,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:48,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:48,593 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:48,593 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:48,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:48,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:48,594 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:48,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:48,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:48,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:48,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:48,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:49,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:51,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:51,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-03 15:50:51,828 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:51,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:50:51,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:50:51,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:50:51,830 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-12-03 15:50:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:51,992 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 15:50:51,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:50:51,993 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-12-03 15:50:51,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:51,994 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:50:51,994 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 15:50:51,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:50:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 15:50:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 15:50:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:50:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 15:50:51,998 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-12-03 15:50:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:51,998 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 15:50:51,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:50:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 15:50:51,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:50:51,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:51,999 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-12-03 15:50:52,000 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:52,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:52,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-12-03 15:50:52,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:52,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:52,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:52,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:52,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:52,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:52,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:52,816 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:52,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 15:50:52,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:52,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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:52,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:52,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:52,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:53,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:56,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:56,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-03 15:50:56,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:56,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 15:50:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 15:50:56,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:50:56,159 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-12-03 15:50:56,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:56,397 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 15:50:56,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:50:56,398 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-12-03 15:50:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:56,399 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:50:56,399 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 15:50:56,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:50:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 15:50:56,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 15:50:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 15:50:56,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 15:50:56,404 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-12-03 15:50:56,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:56,405 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 15:50:56,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 15:50:56,405 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 15:50:56,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 15:50:56,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:56,406 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-12-03 15:50:56,406 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:56,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:56,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-12-03 15:50:56,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:56,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:56,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:56,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:57,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:57,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:57,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:57,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:57,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:57,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:50:57,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:57,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:57,442 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 15:50:57,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:57,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:58,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:00,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:00,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:00,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-03 15:51:00,941 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:00,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:51:00,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:51:00,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:51:00,944 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-12-03 15:51:01,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:01,155 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 15:51:01,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:51:01,155 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-12-03 15:51:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:01,156 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:51:01,157 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:51:01,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:51:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:51:01,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 15:51:01,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:51:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 15:51:01,163 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-12-03 15:51:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:01,163 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 15:51:01,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:51:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 15:51:01,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:51:01,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:01,164 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-12-03 15:51:01,164 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:01,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:01,165 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-12-03 15:51:01,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:01,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:01,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:01,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:01,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:02,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:02,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:02,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:02,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:02,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:02,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:02,135 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:02,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:02,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:02,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:02,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:02,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:03,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:05,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:05,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-03 15:51:05,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:05,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:51:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:51:05,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 15:51:05,601 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-12-03 15:51:05,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:05,862 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 15:51:05,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:51:05,863 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-12-03 15:51:05,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:05,863 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:51:05,863 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 15:51:05,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 15:51:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 15:51:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 15:51:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:51:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 15:51:05,868 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-12-03 15:51:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:05,868 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 15:51:05,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:51:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 15:51:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:51:05,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:05,869 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-12-03 15:51:05,869 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:05,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:05,869 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-12-03 15:51:05,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:05,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:05,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:07,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:07,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:07,528 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:07,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:07,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:07,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:07,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:07,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:07,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:08,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:08,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:11,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:11,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-03 15:51:11,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:11,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 15:51:11,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 15:51:11,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:51:11,294 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-12-03 15:51:11,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:11,571 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 15:51:11,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:51:11,571 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-12-03 15:51:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:11,572 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:51:11,572 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 15:51:11,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:51:11,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 15:51:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 15:51:11,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 15:51:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 15:51:11,577 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-12-03 15:51:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:11,577 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 15:51:11,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 15:51:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 15:51:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 15:51:11,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:11,578 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-12-03 15:51:11,578 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:11,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:11,578 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-12-03 15:51:11,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:11,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:11,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:11,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:11,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:12,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:12,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:12,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:12,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:12,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:12,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:12,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:12,591 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:12,591 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:12,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 15:51:12,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:12,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:13,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:13,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:16,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:16,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-03 15:51:16,451 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:16,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:51:16,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:51:16,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 15:51:16,453 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-12-03 15:51:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:16,632 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 15:51:16,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:51:16,633 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-12-03 15:51:16,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:16,634 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:51:16,634 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:51:16,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 15:51:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:51:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 15:51:16,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:51:16,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 15:51:16,640 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-12-03 15:51:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:16,640 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 15:51:16,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:51:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 15:51:16,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 15:51:16,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:16,640 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-12-03 15:51:16,641 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:16,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:16,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-12-03 15:51:16,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:16,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:16,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:16,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:16,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:17,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:17,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:17,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:17,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:17,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:17,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:17,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:17,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:17,664 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:17,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:17,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:18,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:21,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:21,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-03 15:51:21,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:21,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:51:21,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:51:21,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:51:21,918 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-12-03 15:51:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:22,145 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 15:51:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:51:22,146 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-12-03 15:51:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:22,147 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:51:22,147 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 15:51:22,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:51:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 15:51:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 15:51:22,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:51:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 15:51:22,151 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-12-03 15:51:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:22,151 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 15:51:22,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:51:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 15:51:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:51:22,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:22,152 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-12-03 15:51:22,152 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:22,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:22,152 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-12-03 15:51:22,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:22,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:22,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:22,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:23,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:23,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:23,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:23,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:23,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:23,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:23,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:23,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:23,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:25,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:28,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:28,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-03 15:51:28,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:28,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 15:51:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 15:51:28,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:51:28,466 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-12-03 15:51:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:28,681 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 15:51:28,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:51:28,681 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-12-03 15:51:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:28,682 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:51:28,682 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 15:51:28,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 15:51:28,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 15:51:28,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 15:51:28,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:51:28,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 15:51:28,688 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-12-03 15:51:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:28,688 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 15:51:28,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 15:51:28,688 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 15:51:28,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 15:51:28,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:28,689 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-12-03 15:51:28,689 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:28,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:28,689 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-12-03 15:51:28,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:28,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:28,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:28,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:28,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:29,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:29,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:29,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:29,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:29,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 15:51:29,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:29,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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:29,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:29,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:29,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 15:51:29,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:29,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:31,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:34,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:34,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-03 15:51:34,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:34,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 15:51:34,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 15:51:34,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:51:34,862 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-12-03 15:51:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:35,083 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 15:51:35,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:51:35,084 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-12-03 15:51:35,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:35,084 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:51:35,085 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:51:35,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:51:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:51:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:51:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:51:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 15:51:35,090 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-12-03 15:51:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:35,090 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 15:51:35,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 15:51:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 15:51:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:51:35,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:35,091 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-12-03 15:51:35,091 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:35,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-12-03 15:51:35,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:35,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:35,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:35,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:36,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:36,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:36,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:36,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:36,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:36,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:36,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:36,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:36,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:36,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:38,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:41,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:41,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-03 15:51:41,016 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:41,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 15:51:41,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 15:51:41,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 15:51:41,019 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-12-03 15:51:41,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:41,223 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 15:51:41,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:51:41,224 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-12-03 15:51:41,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:41,224 INFO L225 Difference]: With dead ends: 103 [2018-12-03 15:51:41,224 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 15:51:41,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 15:51:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 15:51:41,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 15:51:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 15:51:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 15:51:41,230 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-12-03 15:51:41,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:41,230 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 15:51:41,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 15:51:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 15:51:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 15:51:41,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:41,231 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-12-03 15:51:41,231 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:41,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-12-03 15:51:41,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:41,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:41,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:42,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:42,769 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:42,769 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:42,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 15:51:42,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:42,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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:42,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:42,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:42,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:42,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:44,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:44,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:48,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:48,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:48,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-03 15:51:48,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:48,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:51:48,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:51:48,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:51:48,203 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-12-03 15:51:48,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:48,442 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 15:51:48,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:51:48,443 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-12-03 15:51:48,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:48,444 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:51:48,444 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 15:51:48,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:51:48,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 15:51:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 15:51:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 15:51:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 15:51:48,450 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-12-03 15:51:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:48,450 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 15:51:48,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:51:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 15:51:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 15:51:48,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:48,451 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-12-03 15:51:48,451 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:48,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:48,451 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-12-03 15:51:48,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:48,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:48,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:48,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:48,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:49,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:49,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:49,763 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:49,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:49,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:49,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:49,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:49,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:49,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 15:51:49,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:49,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:51,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:51,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:54,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:54,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:54,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2018-12-03 15:51:54,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:54,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 15:51:54,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 15:51:54,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 15:51:54,733 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-12-03 15:51:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:56,332 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 15:51:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:51:56,333 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-12-03 15:51:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:56,335 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:51:56,335 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:51:56,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10302 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 15:51:56,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:51:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 15:51:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:51:56,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 15:51:56,341 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-12-03 15:51:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:56,341 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 15:51:56,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 15:51:56,342 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 15:51:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:51:56,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:56,342 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-12-03 15:51:56,343 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:56,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:56,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-12-03 15:51:56,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:56,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:56,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:56,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:56,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:58,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:58,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:58,121 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:58,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 15:51:58,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:58,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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:51:58,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:58,130 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:58,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:58,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:58,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:59,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:03,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:03,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:03,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 156 [2018-12-03 15:52:03,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:03,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 15:52:03,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 15:52:03,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:52:03,160 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-12-03 15:52:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:03,398 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 15:52:03,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:52:03,398 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-12-03 15:52:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:03,399 INFO L225 Difference]: With dead ends: 109 [2018-12-03 15:52:03,399 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 15:52:03,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10712 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:52:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 15:52:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 15:52:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:52:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 15:52:03,405 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-12-03 15:52:03,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:03,405 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 15:52:03,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 15:52:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 15:52:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:52:03,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:03,406 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-12-03 15:52:03,406 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:03,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:03,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-12-03 15:52:03,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:03,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:03,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:03,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:04,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:04,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:04,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:04,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:04,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:04,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:04,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:04,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:04,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:06,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:06,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:09,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:09,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 159 [2018-12-03 15:52:09,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:09,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 15:52:09,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 15:52:09,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 15:52:09,876 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-12-03 15:52:10,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:10,145 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 15:52:10,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:52:10,146 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-12-03 15:52:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:10,147 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:52:10,147 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 15:52:10,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11130 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 15:52:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 15:52:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 15:52:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 15:52:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 15:52:10,151 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-12-03 15:52:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:10,151 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 15:52:10,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 15:52:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 15:52:10,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 15:52:10,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:10,152 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-12-03 15:52:10,153 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:10,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:10,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-12-03 15:52:10,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:10,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:10,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:10,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:10,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:11,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:11,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:11,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:11,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 15:52:11,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:11,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:11,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:11,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:11,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 15:52:11,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:11,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:13,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:16,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:16,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 162 [2018-12-03 15:52:16,854 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:16,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 15:52:16,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 15:52:16,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:52:16,856 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-12-03 15:52:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:17,074 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 15:52:17,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:52:17,074 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-12-03 15:52:17,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:17,075 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:52:17,075 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:52:17,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11556 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:52:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:52:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 15:52:17,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:52:17,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 15:52:17,079 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-12-03 15:52:17,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:17,080 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 15:52:17,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 15:52:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 15:52:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:52:17,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:17,080 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-12-03 15:52:17,080 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:17,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:17,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-12-03 15:52:17,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:17,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:17,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:17,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:17,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:18,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:18,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:18,830 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:18,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 15:52:18,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:18,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:18,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:18,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:18,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:18,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:18,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:20,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:20,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:24,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:24,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:24,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 165 [2018-12-03 15:52:24,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:24,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 15:52:24,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 15:52:24,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:52:24,330 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-12-03 15:52:24,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:24,669 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 15:52:24,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:52:24,669 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-12-03 15:52:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:24,671 INFO L225 Difference]: With dead ends: 115 [2018-12-03 15:52:24,671 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 15:52:24,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11990 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 15:52:24,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 15:52:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 15:52:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:52:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 15:52:24,676 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-12-03 15:52:24,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:24,677 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 15:52:24,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 15:52:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 15:52:24,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:52:24,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:24,678 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-12-03 15:52:24,678 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:24,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-12-03 15:52:24,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:24,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:24,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:24,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:26,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:26,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:26,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:26,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:26,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:26,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:26,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:26,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:26,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:26,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:28,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:32,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:32,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:32,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 168 [2018-12-03 15:52:32,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:32,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 15:52:32,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 15:52:32,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:52:32,029 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-12-03 15:52:32,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:32,572 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 15:52:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:52:32,572 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-12-03 15:52:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:32,573 INFO L225 Difference]: With dead ends: 117 [2018-12-03 15:52:32,573 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 15:52:32,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12432 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:52:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 15:52:32,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 15:52:32,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 15:52:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 15:52:32,579 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-12-03 15:52:32,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:32,580 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 15:52:32,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 15:52:32,580 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 15:52:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 15:52:32,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:32,581 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-12-03 15:52:32,581 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:32,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:32,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-12-03 15:52:32,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:32,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:32,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:32,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:32,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:34,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:34,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:34,186 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:34,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 15:52:34,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:34,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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:34,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:34,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:34,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 15:52:34,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:34,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:36,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:40,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:40,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 171 [2018-12-03 15:52:40,076 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:40,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 15:52:40,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 15:52:40,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 15:52:40,079 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-12-03 15:52:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:40,395 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-03 15:52:40,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:52:40,396 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-12-03 15:52:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:40,397 INFO L225 Difference]: With dead ends: 119 [2018-12-03 15:52:40,397 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 15:52:40,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 15:52:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 15:52:40,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 15:52:40,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 15:52:40,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 15:52:40,402 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-12-03 15:52:40,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:40,402 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 15:52:40,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 15:52:40,403 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 15:52:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 15:52:40,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:40,403 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-12-03 15:52:40,403 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:40,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:40,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-12-03 15:52:40,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:40,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:40,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:40,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:40,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:41,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:41,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:41,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:41,987 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:41,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 15:52:41,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:41,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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:41,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:41,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:42,026 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:42,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:42,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:44,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:44,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:48,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:48,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 174 [2018-12-03 15:52:48,394 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:48,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 15:52:48,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 15:52:48,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:52:48,396 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-12-03 15:52:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:48,675 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-12-03 15:52:48,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:52:48,676 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-12-03 15:52:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:48,676 INFO L225 Difference]: With dead ends: 121 [2018-12-03 15:52:48,676 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 15:52:48,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13340 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:52:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 15:52:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 15:52:48,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 15:52:48,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-12-03 15:52:48,681 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-12-03 15:52:48,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:48,681 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-12-03 15:52:48,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 15:52:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-12-03 15:52:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 15:52:48,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:48,682 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-12-03 15:52:48,682 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:48,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-12-03 15:52:48,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:48,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:48,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:48,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:48,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:50,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:50,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:50,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:50,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:50,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:50,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:50,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:50,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:50,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:52,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:56,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:56,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 177 [2018-12-03 15:52:56,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:56,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 15:52:56,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 15:52:56,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 15:52:56,843 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-12-03 15:52:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:57,122 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-12-03 15:52:57,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:52:57,123 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-12-03 15:52:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:57,124 INFO L225 Difference]: With dead ends: 123 [2018-12-03 15:52:57,124 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 15:52:57,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13806 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 15:52:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 15:52:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 15:52:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 15:52:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-12-03 15:52:57,131 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-12-03 15:52:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:57,131 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-12-03 15:52:57,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 15:52:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-12-03 15:52:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 15:52:57,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:57,132 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-12-03 15:52:57,133 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:57,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-12-03 15:52:57,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:57,134 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:58,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:58,995 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:58,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:58,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:58,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:52:59,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:59,005 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:59,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 15:52:59,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:59,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:01,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:01,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:05,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:05,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:05,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 180 [2018-12-03 15:53:05,625 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:05,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 15:53:05,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 15:53:05,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:53:05,628 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-12-03 15:53:05,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:05,901 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-12-03 15:53:05,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:53:05,901 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-12-03 15:53:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:05,902 INFO L225 Difference]: With dead ends: 125 [2018-12-03 15:53:05,902 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:53:05,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14280 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:53:05,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:53:05,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 15:53:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:53:05,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-03 15:53:05,907 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-12-03 15:53:05,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:05,907 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-03 15:53:05,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 15:53:05,908 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-03 15:53:05,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:53:05,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:05,908 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-12-03 15:53:05,909 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:05,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:05,909 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-12-03 15:53:05,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:05,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:07,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,641 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:07,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:07,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 15:53:07,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:07,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:07,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:07,687 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:07,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:07,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:14,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:14,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 183 [2018-12-03 15:53:14,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:14,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-03 15:53:14,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-03 15:53:14,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 15:53:14,707 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-12-03 15:53:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:14,989 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-12-03 15:53:14,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:53:14,989 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-12-03 15:53:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:14,990 INFO L225 Difference]: With dead ends: 127 [2018-12-03 15:53:14,990 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 15:53:14,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14762 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 15:53:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 15:53:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 15:53:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 15:53:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-03 15:53:14,998 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-12-03 15:53:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:14,998 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-03 15:53:14,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-03 15:53:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-03 15:53:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 15:53:14,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:14,999 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-12-03 15:53:14,999 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:14,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:14,999 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-12-03 15:53:14,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:15,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:15,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:15,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:15,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:16,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:16,681 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:16,681 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:16,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 15:53:16,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:16,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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:16,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:16,689 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:16,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:18,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:23,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:23,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:23,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 186 [2018-12-03 15:53:23,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:23,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 15:53:23,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 15:53:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:53:23,544 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-12-03 15:53:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:23,859 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-12-03 15:53:23,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:53:23,859 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-12-03 15:53:23,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:23,860 INFO L225 Difference]: With dead ends: 129 [2018-12-03 15:53:23,861 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 15:53:23,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15252 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:53:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 15:53:23,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 15:53:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 15:53:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-12-03 15:53:23,865 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-12-03 15:53:23,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:23,866 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-12-03 15:53:23,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 15:53:23,866 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-12-03 15:53:23,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 15:53:23,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:23,866 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-12-03 15:53:23,867 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:23,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:23,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-12-03 15:53:23,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:23,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:23,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:23,868 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:23,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:26,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:26,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,692 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:26,693 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:26,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 15:53:26,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:26,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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:26,702 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:26,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:26,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 15:53:26,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:26,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:28,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:33,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:33,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 189 [2018-12-03 15:53:33,900 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:33,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-03 15:53:33,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-03 15:53:33,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 15:53:33,902 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-12-03 15:53:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:34,315 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-12-03 15:53:34,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:53:34,315 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-12-03 15:53:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:34,316 INFO L225 Difference]: With dead ends: 131 [2018-12-03 15:53:34,316 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 15:53:34,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15750 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 15:53:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 15:53:34,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 15:53:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:53:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-03 15:53:34,323 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-12-03 15:53:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:34,323 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-03 15:53:34,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-03 15:53:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-03 15:53:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 15:53:34,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:34,324 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-12-03 15:53:34,325 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:34,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:34,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-12-03 15:53:34,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:34,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:34,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:34,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:36,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:36,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:36,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:36,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 15:53:36,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:36,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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:36,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:53:36,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:53:36,910 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:53:36,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:36,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:39,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:44,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:44,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 192 [2018-12-03 15:53:44,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:44,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 15:53:44,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 15:53:44,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:53:44,302 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-12-03 15:53:44,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:44,753 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-12-03 15:53:44,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:53:44,754 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-12-03 15:53:44,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:44,755 INFO L225 Difference]: With dead ends: 133 [2018-12-03 15:53:44,755 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 15:53:44,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16256 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:53:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 15:53:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 15:53:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:53:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-12-03 15:53:44,762 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-12-03 15:53:44,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:44,763 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-12-03 15:53:44,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 15:53:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-12-03 15:53:44,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 15:53:44,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:44,764 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-12-03 15:53:44,764 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:44,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:44,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-12-03 15:53:44,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:44,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:44,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:46,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:46,539 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:46,539 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:46,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:46,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:46,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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:46,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:46,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:48,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:54,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:54,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 195 [2018-12-03 15:53:54,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:54,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 15:53:54,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 15:53:54,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 15:53:54,104 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-12-03 15:53:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:54,404 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-03 15:53:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:53:54,404 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-12-03 15:53:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:54,405 INFO L225 Difference]: With dead ends: 135 [2018-12-03 15:53:54,405 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 15:53:54,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16770 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 15:53:54,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 15:53:54,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 15:53:54,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 15:53:54,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-12-03 15:53:54,411 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-12-03 15:53:54,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:54,411 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-12-03 15:53:54,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 15:53:54,411 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-12-03 15:53:54,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 15:53:54,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:54,412 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-12-03 15:53:54,412 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:54,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:54,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-12-03 15:53:54,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:54,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:54,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:54,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:54,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:56,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:56,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:56,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:56,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:56,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:56,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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:53:56,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:56,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:56,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 15:53:56,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:56,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:00,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:00,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:05,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:05,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 198 [2018-12-03 15:54:05,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:05,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 15:54:05,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 15:54:05,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 15:54:05,687 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-12-03 15:54:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:06,020 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-12-03 15:54:06,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:54:06,020 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-12-03 15:54:06,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:06,022 INFO L225 Difference]: With dead ends: 137 [2018-12-03 15:54:06,022 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 15:54:06,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17292 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 15:54:06,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 15:54:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 15:54:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:54:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-03 15:54:06,028 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-12-03 15:54:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:06,029 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-03 15:54:06,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 15:54:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-03 15:54:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:54:06,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:06,030 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-12-03 15:54:06,030 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:06,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:06,030 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-12-03 15:54:06,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:06,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:06,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:06,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:06,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:08,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:08,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:08,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:08,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 15:54:08,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:08,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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:08,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:08,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:08,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:08,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:08,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:10,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:16,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:16,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 201 [2018-12-03 15:54:16,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:16,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-03 15:54:16,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-03 15:54:16,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 15:54:16,466 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-12-03 15:54:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:16,853 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-12-03 15:54:16,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:54:16,853 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-12-03 15:54:16,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:16,854 INFO L225 Difference]: With dead ends: 139 [2018-12-03 15:54:16,854 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 15:54:16,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17822 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 15:54:16,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 15:54:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 15:54:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 15:54:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-12-03 15:54:16,858 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-12-03 15:54:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:16,859 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-12-03 15:54:16,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-03 15:54:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-12-03 15:54:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 15:54:16,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:16,859 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2018-12-03 15:54:16,860 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:16,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2018-12-03 15:54:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:16,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:16,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:16,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:16,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:18,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:18,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:18,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:18,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:18,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:18,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:18,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:18,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:18,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:21,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:27,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:27,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 204 [2018-12-03 15:54:27,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:27,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 15:54:27,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 15:54:27,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:54:27,365 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-12-03 15:54:27,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:27,704 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-03 15:54:27,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:54:27,704 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-12-03 15:54:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:27,705 INFO L225 Difference]: With dead ends: 141 [2018-12-03 15:54:27,705 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 15:54:27,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18360 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:54:27,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 15:54:27,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 15:54:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 15:54:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-12-03 15:54:27,710 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-12-03 15:54:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:27,710 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-12-03 15:54:27,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 15:54:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-12-03 15:54:27,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 15:54:27,710 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:27,711 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2018-12-03 15:54:27,711 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:27,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2018-12-03 15:54:27,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:27,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:27,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:29,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:29,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:29,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:29,706 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:29,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:29,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:29,706 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:29,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:29,716 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:29,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 15:54:29,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:29,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:32,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:38,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:38,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:38,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 207 [2018-12-03 15:54:38,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:38,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-03 15:54:38,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-03 15:54:38,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 15:54:38,415 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-12-03 15:54:38,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:38,776 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-12-03 15:54:38,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:54:38,776 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-12-03 15:54:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:38,777 INFO L225 Difference]: With dead ends: 143 [2018-12-03 15:54:38,777 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 15:54:38,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18906 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 15:54:38,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 15:54:38,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 15:54:38,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 15:54:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-12-03 15:54:38,782 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-12-03 15:54:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:38,782 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-12-03 15:54:38,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-03 15:54:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-12-03 15:54:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 15:54:38,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:38,783 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2018-12-03 15:54:38,783 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:38,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:38,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2018-12-03 15:54:38,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:38,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:38,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:38,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:38,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:41,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:41,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:41,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:41,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:41,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:41,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:41,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:41,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:41,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:41,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:41,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:41,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:43,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:43,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:49,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:49,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 210 [2018-12-03 15:54:49,859 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:49,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 15:54:49,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 15:54:49,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 15:54:49,862 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-12-03 15:54:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:50,265 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-12-03 15:54:50,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:54:50,266 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-12-03 15:54:50,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:50,267 INFO L225 Difference]: With dead ends: 145 [2018-12-03 15:54:50,267 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 15:54:50,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19460 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 15:54:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 15:54:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 15:54:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 15:54:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-12-03 15:54:50,272 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-12-03 15:54:50,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:50,272 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-12-03 15:54:50,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 15:54:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-12-03 15:54:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 15:54:50,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:50,273 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2018-12-03 15:54:50,273 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:50,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:50,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2018-12-03 15:54:50,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:50,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:50,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:50,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:52,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:52,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:52,625 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:52,625 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:52,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 15:54:52,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:52,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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:54:52,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:52,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:52,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:55,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:01,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:01,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:01,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 213 [2018-12-03 15:55:01,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:01,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 15:55:01,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 15:55:01,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 15:55:01,878 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-12-03 15:55:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:02,256 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-12-03 15:55:02,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:55:02,257 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-12-03 15:55:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:02,258 INFO L225 Difference]: With dead ends: 147 [2018-12-03 15:55:02,258 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 15:55:02,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20022 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 15:55:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 15:55:02,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 15:55:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 15:55:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-12-03 15:55:02,265 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-12-03 15:55:02,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:02,266 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-12-03 15:55:02,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-03 15:55:02,266 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-12-03 15:55:02,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 15:55:02,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:02,267 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2018-12-03 15:55:02,267 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:02,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:02,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2018-12-03 15:55:02,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:02,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:02,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:02,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:04,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:04,514 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:04,514 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:04,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 15:55:04,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:04,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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:04,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:04,524 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:04,729 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 15:55:04,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:04,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:08,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:08,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:14,399 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:14,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:14,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 216 [2018-12-03 15:55:14,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:14,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-03 15:55:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-03 15:55:14,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 15:55:14,421 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-12-03 15:55:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:14,855 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-12-03 15:55:14,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:55:14,856 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-12-03 15:55:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:14,857 INFO L225 Difference]: With dead ends: 149 [2018-12-03 15:55:14,857 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 15:55:14,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20592 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 15:55:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 15:55:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 15:55:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 15:55:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-12-03 15:55:14,863 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-12-03 15:55:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:14,863 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-12-03 15:55:14,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-03 15:55:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-12-03 15:55:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 15:55:14,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:14,865 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2018-12-03 15:55:14,865 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:14,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:14,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2018-12-03 15:55:14,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:14,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:14,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:14,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:17,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:17,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:17,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:17,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:17,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:17,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:17,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:17,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:17,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:17,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:17,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:17,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:20,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:20,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:27,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:27,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:27,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 219 [2018-12-03 15:55:27,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:27,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-03 15:55:27,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-03 15:55:27,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 15:55:27,156 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-12-03 15:55:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:27,573 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-12-03 15:55:27,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:55:27,574 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-12-03 15:55:27,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:27,575 INFO L225 Difference]: With dead ends: 151 [2018-12-03 15:55:27,576 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 15:55:27,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21170 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 15:55:27,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 15:55:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 15:55:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 15:55:27,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-12-03 15:55:27,582 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-12-03 15:55:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:27,583 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-12-03 15:55:27,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-03 15:55:27,583 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-12-03 15:55:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 15:55:27,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:27,584 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2018-12-03 15:55:27,584 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:27,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2018-12-03 15:55:27,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:27,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:27,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:27,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:30,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:30,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:30,042 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:30,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:30,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:30,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:30,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:30,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:30,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:33,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:40,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:40,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 222 [2018-12-03 15:55:40,048 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:40,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-03 15:55:40,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-03 15:55:40,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 15:55:40,051 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-12-03 15:55:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:40,521 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-12-03 15:55:40,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:55:40,522 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-12-03 15:55:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:40,523 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:55:40,523 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 15:55:40,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21756 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 15:55:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 15:55:40,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 15:55:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 15:55:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-12-03 15:55:40,529 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-12-03 15:55:40,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:40,530 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-12-03 15:55:40,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-03 15:55:40,530 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-12-03 15:55:40,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 15:55:40,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:40,531 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2018-12-03 15:55:40,531 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:40,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:40,531 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2018-12-03 15:55:40,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:40,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:40,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:40,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:40,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:43,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:43,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:43,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:43,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:43,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:43,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:43,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:55:43,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:55:43,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-03 15:55:43,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:43,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:46,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:53,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:53,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:53,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 225 [2018-12-03 15:55:53,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:53,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-03 15:55:53,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-03 15:55:53,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 15:55:53,679 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-12-03 15:55:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:54,093 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-12-03 15:55:54,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:55:54,094 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-12-03 15:55:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:54,094 INFO L225 Difference]: With dead ends: 155 [2018-12-03 15:55:54,094 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 15:55:54,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22350 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 15:55:54,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 15:55:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 15:55:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 15:55:54,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-12-03 15:55:54,099 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-12-03 15:55:54,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:54,099 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-12-03 15:55:54,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-03 15:55:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-12-03 15:55:54,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 15:55:54,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:54,100 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2018-12-03 15:55:54,100 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:54,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:54,101 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2018-12-03 15:55:54,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:54,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:54,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:54,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:54,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:56,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:56,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:56,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:56,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 15:55:56,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:56,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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:55:56,506 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:56,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:56,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:56,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:56,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:59,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:06,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:06,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 228 [2018-12-03 15:56:06,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:06,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-03 15:56:06,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-03 15:56:06,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 15:56:06,823 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-12-03 15:56:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:07,285 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-12-03 15:56:07,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:56:07,285 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-12-03 15:56:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:07,286 INFO L225 Difference]: With dead ends: 157 [2018-12-03 15:56:07,286 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 15:56:07,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22952 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 15:56:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 15:56:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 15:56:07,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 15:56:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-12-03 15:56:07,291 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-12-03 15:56:07,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:07,291 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-12-03 15:56:07,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-03 15:56:07,291 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-12-03 15:56:07,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 15:56:07,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:07,292 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2018-12-03 15:56:07,292 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:07,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:07,292 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2018-12-03 15:56:07,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:07,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:07,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:07,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:07,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:10,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:10,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:10,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:10,063 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:10,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:10,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:10,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:10,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:10,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:10,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:13,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:20,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 231 [2018-12-03 15:56:20,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:20,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-03 15:56:20,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-03 15:56:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 15:56:20,925 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2018-12-03 15:56:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:21,306 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-12-03 15:56:21,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:56:21,307 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 155 [2018-12-03 15:56:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:21,307 INFO L225 Difference]: With dead ends: 159 [2018-12-03 15:56:21,307 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 15:56:21,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23562 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 15:56:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 15:56:21,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 15:56:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 15:56:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-12-03 15:56:21,312 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-12-03 15:56:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:21,312 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-12-03 15:56:21,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-03 15:56:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-12-03 15:56:21,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 15:56:21,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:21,313 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2018-12-03 15:56:21,313 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:21,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2018-12-03 15:56:21,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:21,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:21,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:21,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:24,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:24,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:24,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:24,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:24,124 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:24,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-03 15:56:24,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:24,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:35,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 234 [2018-12-03 15:56:35,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:35,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-03 15:56:35,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-03 15:56:35,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 15:56:35,238 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2018-12-03 15:56:35,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:35,668 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-12-03 15:56:35,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:56:35,669 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 157 [2018-12-03 15:56:35,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:35,670 INFO L225 Difference]: With dead ends: 161 [2018-12-03 15:56:35,670 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 15:56:35,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24180 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 15:56:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 15:56:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 15:56:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 15:56:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-12-03 15:56:35,678 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-12-03 15:56:35,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:35,678 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-12-03 15:56:35,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-03 15:56:35,678 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-12-03 15:56:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 15:56:35,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:35,679 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2018-12-03 15:56:35,679 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:35,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:35,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2018-12-03 15:56:35,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:35,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:35,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:35,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:38,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:38,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:38,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:38,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:38,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:38,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:38,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:38,418 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:38,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:38,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:41,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:49,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:49,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 237 [2018-12-03 15:56:49,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:49,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-03 15:56:49,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-03 15:56:49,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 15:56:49,778 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2018-12-03 15:56:50,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:50,228 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-12-03 15:56:50,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:56:50,228 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 159 [2018-12-03 15:56:50,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:50,229 INFO L225 Difference]: With dead ends: 163 [2018-12-03 15:56:50,229 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 15:56:50,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24806 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 15:56:50,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 15:56:50,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 15:56:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 15:56:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-12-03 15:56:50,236 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-12-03 15:56:50,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:50,236 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-12-03 15:56:50,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-03 15:56:50,236 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-12-03 15:56:50,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 15:56:50,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:50,237 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2018-12-03 15:56:50,237 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:50,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:50,238 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2018-12-03 15:56:50,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:50,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:50,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:50,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:52,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:52,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:52,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:52,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 15:56:52,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:52,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:52,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:52,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:53,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:56,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:04,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:04,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:04,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 240 [2018-12-03 15:57:04,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:04,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-03 15:57:04,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-03 15:57:04,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 15:57:04,922 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2018-12-03 15:57:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:05,337 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-03 15:57:05,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:57:05,337 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 161 [2018-12-03 15:57:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:05,338 INFO L225 Difference]: With dead ends: 165 [2018-12-03 15:57:05,338 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 15:57:05,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25440 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 15:57:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 15:57:05,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 15:57:05,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 15:57:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-12-03 15:57:05,346 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-12-03 15:57:05,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:05,346 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-12-03 15:57:05,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-03 15:57:05,346 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-12-03 15:57:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 15:57:05,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:05,347 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2018-12-03 15:57:05,347 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:05,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:05,348 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2018-12-03 15:57:05,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:05,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:05,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:05,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:05,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:08,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:08,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:08,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:08,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 15:57:08,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:08,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:08,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:08,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:08,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-03 15:57:08,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:08,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:12,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:20,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:20,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 243 [2018-12-03 15:57:20,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:20,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-03 15:57:20,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-03 15:57:20,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 15:57:20,471 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2018-12-03 15:57:20,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:20,879 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-12-03 15:57:20,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:57:20,880 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 163 [2018-12-03 15:57:20,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:20,881 INFO L225 Difference]: With dead ends: 167 [2018-12-03 15:57:20,881 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:57:20,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26082 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 15:57:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:57:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 15:57:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 15:57:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-12-03 15:57:20,886 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-12-03 15:57:20,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:20,887 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-12-03 15:57:20,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-03 15:57:20,887 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-12-03 15:57:20,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 15:57:20,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:20,887 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2018-12-03 15:57:20,887 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:20,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:20,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2018-12-03 15:57:20,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:20,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:20,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:20,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:20,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:23,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:23,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:23,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:23,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 15:57:23,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:23,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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:23,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:23,727 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:23,773 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:23,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:23,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:27,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:35,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:36,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:36,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 246 [2018-12-03 15:57:36,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:36,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-03 15:57:36,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-03 15:57:36,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 15:57:36,021 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2018-12-03 15:57:36,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:36,483 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-12-03 15:57:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:57:36,484 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 165 [2018-12-03 15:57:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:36,485 INFO L225 Difference]: With dead ends: 169 [2018-12-03 15:57:36,485 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 15:57:36,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26732 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 15:57:36,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 15:57:36,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 15:57:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 15:57:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-12-03 15:57:36,492 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-12-03 15:57:36,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:36,492 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-12-03 15:57:36,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-03 15:57:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-12-03 15:57:36,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 15:57:36,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:36,493 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2018-12-03 15:57:36,494 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:36,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:36,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2018-12-03 15:57:36,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:36,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:36,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:36,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:36,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:39,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:39,405 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:39,405 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:39,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:39,405 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:39,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:39,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:39,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:43,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:51,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:51,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:51,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 249 [2018-12-03 15:57:51,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:51,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-03 15:57:51,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-03 15:57:51,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 15:57:51,962 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2018-12-03 15:57:52,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:52,748 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-12-03 15:57:52,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:57:52,749 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 167 [2018-12-03 15:57:52,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:52,749 INFO L225 Difference]: With dead ends: 171 [2018-12-03 15:57:52,749 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 15:57:52,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27390 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 15:57:52,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 15:57:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-03 15:57:52,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 15:57:52,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-12-03 15:57:52,755 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-12-03 15:57:52,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:52,755 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-12-03 15:57:52,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-03 15:57:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-12-03 15:57:52,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 15:57:52,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:52,756 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2018-12-03 15:57:52,756 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:52,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:52,756 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2018-12-03 15:57:52,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:52,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:52,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:52,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:52,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:56,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:56,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:56,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:56,036 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:56,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:56,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:56,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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:56,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:56,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:56,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 15:57:56,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:56,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:59,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:59,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:08,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:08,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:08,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 252 [2018-12-03 15:58:08,722 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:08,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-03 15:58:08,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-03 15:58:08,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 15:58:08,725 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2018-12-03 15:58:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:09,183 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-12-03 15:58:09,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:58:09,183 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 169 [2018-12-03 15:58:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:09,184 INFO L225 Difference]: With dead ends: 173 [2018-12-03 15:58:09,184 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 15:58:09,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28056 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 15:58:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 15:58:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 15:58:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 15:58:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-12-03 15:58:09,190 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-12-03 15:58:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:09,190 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-12-03 15:58:09,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-03 15:58:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-12-03 15:58:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 15:58:09,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:09,191 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2018-12-03 15:58:09,191 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:09,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:09,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2018-12-03 15:58:09,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:09,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:09,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:09,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:12,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:12,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:12,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:12,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:12,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:12,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:12,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:12,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:12,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:12,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:12,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:16,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:25,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:25,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 255 [2018-12-03 15:58:25,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:25,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-12-03 15:58:25,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-12-03 15:58:25,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 15:58:25,580 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2018-12-03 15:58:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:26,062 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-12-03 15:58:26,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:58:26,062 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 171 [2018-12-03 15:58:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:26,063 INFO L225 Difference]: With dead ends: 175 [2018-12-03 15:58:26,063 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 15:58:26,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28730 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 15:58:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 15:58:26,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-12-03 15:58:26,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 15:58:26,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-12-03 15:58:26,069 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-12-03 15:58:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:26,069 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-12-03 15:58:26,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-12-03 15:58:26,069 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-12-03 15:58:26,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 15:58:26,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:26,070 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2018-12-03 15:58:26,071 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:26,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:26,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2018-12-03 15:58:26,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:26,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:26,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:29,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:29,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:29,240 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:29,240 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:29,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 15:58:29,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:29,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:29,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:29,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:29,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:33,401 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:33,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:42,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:42,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:42,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 258 [2018-12-03 15:58:42,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:42,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-03 15:58:42,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-03 15:58:42,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 15:58:42,736 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2018-12-03 15:58:43,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:43,199 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-12-03 15:58:43,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:58:43,199 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 173 [2018-12-03 15:58:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:43,200 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:58:43,200 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 15:58:43,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29412 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 15:58:43,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 15:58:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 15:58:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 15:58:43,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-12-03 15:58:43,207 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-12-03 15:58:43,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:43,207 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-12-03 15:58:43,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-03 15:58:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-12-03 15:58:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 15:58:43,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:43,209 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2018-12-03 15:58:43,209 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:43,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:43,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2018-12-03 15:58:43,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:43,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:43,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:43,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:43,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:46,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:46,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:46,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:46,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 15:58:46,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:46,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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:46,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:58:46,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:46,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 15:58:46,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:46,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:50,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:00,167 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:00,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 261 [2018-12-03 15:59:00,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:00,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-03 15:59:00,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-03 15:59:00,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 15:59:00,191 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2018-12-03 15:59:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:00,717 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-12-03 15:59:00,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:59:00,717 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 175 [2018-12-03 15:59:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:00,718 INFO L225 Difference]: With dead ends: 179 [2018-12-03 15:59:00,718 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 15:59:00,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30102 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 15:59:00,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 15:59:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 15:59:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 15:59:00,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-12-03 15:59:00,723 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-12-03 15:59:00,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:00,724 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-12-03 15:59:00,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-03 15:59:00,724 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-12-03 15:59:00,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 15:59:00,724 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:00,724 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2018-12-03 15:59:00,725 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:00,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:00,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2018-12-03 15:59:00,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:00,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:00,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:00,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:00,726 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:04,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:04,403 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:04,403 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:04,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 15:59:04,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:04,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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:04,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:59:04,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:59:04,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:59:04,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:04,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:08,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:18,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:18,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:18,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 264 [2018-12-03 15:59:18,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:18,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-03 15:59:18,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-03 15:59:18,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 15:59:18,683 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2018-12-03 15:59:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:19,214 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-12-03 15:59:19,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:59:19,214 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 177 [2018-12-03 15:59:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:19,215 INFO L225 Difference]: With dead ends: 181 [2018-12-03 15:59:19,215 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 15:59:19,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30800 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 15:59:19,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 15:59:19,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-03 15:59:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 15:59:19,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-12-03 15:59:19,220 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-12-03 15:59:19,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:19,221 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-12-03 15:59:19,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-03 15:59:19,221 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-12-03 15:59:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 15:59:19,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:19,221 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2018-12-03 15:59:19,222 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:19,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:19,222 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2018-12-03 15:59:19,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:19,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:19,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:19,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:19,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:22,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:22,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:22,818 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:22,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 15:59:22,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:22,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:22,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:22,827 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:22,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:27,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:36,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:36,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 267 [2018-12-03 15:59:36,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:36,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-03 15:59:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-03 15:59:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 15:59:36,948 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2018-12-03 15:59:37,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:37,523 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-12-03 15:59:37,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:59:37,523 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 179 [2018-12-03 15:59:37,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:37,524 INFO L225 Difference]: With dead ends: 183 [2018-12-03 15:59:37,524 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 15:59:37,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31506 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 15:59:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 15:59:37,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 15:59:37,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 15:59:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-12-03 15:59:37,530 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-12-03 15:59:37,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:37,530 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-12-03 15:59:37,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-03 15:59:37,530 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-12-03 15:59:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 15:59:37,531 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:37,531 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2018-12-03 15:59:37,531 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:37,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:37,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2018-12-03 15:59:37,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:37,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:37,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:37,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:37,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:41,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:41,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:41,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:41,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 15:59:41,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:41,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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:41,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:41,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:41,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-03 15:59:41,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:41,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:45,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:56,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:56,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 270 [2018-12-03 15:59:56,135 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:56,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-03 15:59:56,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-03 15:59:56,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 15:59:56,139 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2018-12-03 15:59:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:56,614 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-12-03 15:59:56,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 15:59:56,615 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 181 [2018-12-03 15:59:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:56,616 INFO L225 Difference]: With dead ends: 185 [2018-12-03 15:59:56,616 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 15:59:56,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32220 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 15:59:56,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 15:59:56,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 15:59:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 15:59:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-12-03 15:59:56,622 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-12-03 15:59:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:56,623 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-12-03 15:59:56,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-03 15:59:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-12-03 15:59:56,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 15:59:56,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:56,624 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2018-12-03 15:59:56,624 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:56,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:56,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2018-12-03 15:59:56,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:56,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:56,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:56,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:56,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:00,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:00,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:00,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 16:00:00,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:00,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 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:00:00,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:00,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:00,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:00,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:00,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:05,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:15,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:15,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:15,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 273 [2018-12-03 16:00:15,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:15,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-12-03 16:00:15,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-12-03 16:00:15,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 16:00:15,462 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 184 states. [2018-12-03 16:00:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:16,035 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-12-03 16:00:16,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:00:16,036 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 183 [2018-12-03 16:00:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:16,037 INFO L225 Difference]: With dead ends: 187 [2018-12-03 16:00:16,037 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 16:00:16,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32942 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 16:00:16,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 16:00:16,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 16:00:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 16:00:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-12-03 16:00:16,043 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-12-03 16:00:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:16,044 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-12-03 16:00:16,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-12-03 16:00:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-12-03 16:00:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 16:00:16,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:16,045 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2018-12-03 16:00:16,045 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:16,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:16,046 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2018-12-03 16:00:16,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:16,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:16,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:16,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:16,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:20,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:20,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:20,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:20,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:20,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:20,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:20,016 INFO 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:00:20,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:20,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:20,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:24,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:35,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:35,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:35,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 276 [2018-12-03 16:00:35,132 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:35,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-03 16:00:35,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-03 16:00:35,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 16:00:35,136 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 186 states. [2018-12-03 16:00:35,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:35,634 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-12-03 16:00:35,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:00:35,634 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 185 [2018-12-03 16:00:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:35,635 INFO L225 Difference]: With dead ends: 189 [2018-12-03 16:00:35,635 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 16:00:35,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33672 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 16:00:35,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 16:00:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-03 16:00:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 16:00:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-12-03 16:00:35,642 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-12-03 16:00:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:35,642 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-12-03 16:00:35,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-03 16:00:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-12-03 16:00:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 16:00:35,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:35,643 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2018-12-03 16:00:35,644 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:35,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:35,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2018-12-03 16:00:35,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:35,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:35,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:39,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:39,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:39,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:39,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:39,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:39,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 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:00:39,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:39,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:39,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-03 16:00:39,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:39,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:44,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:55,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:55,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 279 [2018-12-03 16:00:55,271 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:55,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-03 16:00:55,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-03 16:00:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 16:00:55,274 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 188 states. [2018-12-03 16:00:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:55,923 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-12-03 16:00:55,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 16:00:55,923 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 187 [2018-12-03 16:00:55,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:55,924 INFO L225 Difference]: With dead ends: 191 [2018-12-03 16:00:55,924 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 16:00:55,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34410 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 16:00:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 16:00:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 16:00:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 16:00:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-12-03 16:00:55,931 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-12-03 16:00:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:55,931 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-12-03 16:00:55,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-03 16:00:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-12-03 16:00:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 16:00:55,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:55,932 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2018-12-03 16:00:55,932 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:55,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2018-12-03 16:00:55,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:55,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:55,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:55,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:59,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:59,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:59,893 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:59,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:59,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:59,893 INFO 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:00:59,901 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:59,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:59,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:59,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:59,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:04,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:15,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:15,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 282 [2018-12-03 16:01:15,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:15,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-03 16:01:15,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-03 16:01:15,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 16:01:15,939 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 190 states. [2018-12-03 16:01:16,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:16,494 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-12-03 16:01:16,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:01:16,494 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 189 [2018-12-03 16:01:16,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:16,495 INFO L225 Difference]: With dead ends: 193 [2018-12-03 16:01:16,495 INFO L226 Difference]: Without dead ends: 192 [2018-12-03 16:01:16,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35156 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 16:01:16,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-03 16:01:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-12-03 16:01:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 16:01:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-12-03 16:01:16,501 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-12-03 16:01:16,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:16,501 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-12-03 16:01:16,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-03 16:01:16,501 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-12-03 16:01:16,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 16:01:16,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:16,502 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2018-12-03 16:01:16,502 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:16,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:16,502 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2018-12-03 16:01:16,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:16,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:16,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:16,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:16,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:20,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:20,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:20,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:20,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:01:20,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:20,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 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:01:20,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:20,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:20,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:25,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:36,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:36,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 285 [2018-12-03 16:01:36,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:36,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-03 16:01:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-03 16:01:36,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 16:01:36,638 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 192 states. [2018-12-03 16:01:37,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:37,174 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-03 16:01:37,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:01:37,175 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 191 [2018-12-03 16:01:37,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:37,176 INFO L225 Difference]: With dead ends: 195 [2018-12-03 16:01:37,176 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 16:01:37,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35910 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 16:01:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 16:01:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-12-03 16:01:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 16:01:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-12-03 16:01:37,182 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-12-03 16:01:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:37,183 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-12-03 16:01:37,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-03 16:01:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-12-03 16:01:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 16:01:37,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:37,184 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2018-12-03 16:01:37,184 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:37,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:37,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2018-12-03 16:01:37,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:37,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:37,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:37,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:37,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:41,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:41,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:41,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:41,304 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:41,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:41,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:41,305 INFO 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:01:41,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:41,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:41,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-03 16:01:41,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:41,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:46,596 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:46,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:58,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:58,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 288 [2018-12-03 16:01:58,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:58,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-03 16:01:58,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-03 16:01:58,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 16:01:58,078 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 194 states. [2018-12-03 16:01:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:58,649 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-12-03 16:01:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:01:58,649 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 193 [2018-12-03 16:01:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:58,650 INFO L225 Difference]: With dead ends: 197 [2018-12-03 16:01:58,650 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 16:01:58,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36672 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 16:01:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 16:01:58,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 16:01:58,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 16:01:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-12-03 16:01:58,655 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-12-03 16:01:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:58,655 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-12-03 16:01:58,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-03 16:01:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-12-03 16:01:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 16:01:58,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:58,657 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2018-12-03 16:01:58,657 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:58,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:58,657 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2018-12-03 16:01:58,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:58,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:58,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:58,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:02:02,814 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:02,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:02,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:02:02,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:02:02,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:02:02,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:02:02,815 INFO 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:02:02,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:02:02,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:02:02,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:02:02,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:02:02,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:02:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:02:08,089 INFO L316 TraceCheckSpWp]: Computing backward predicates...