java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:59:29,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:59:29,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:59:29,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:59:29,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:59:29,917 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:59:29,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:59:29,921 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:59:29,923 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:59:29,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:59:29,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:59:29,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:59:29,928 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:59:29,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:59:29,939 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:59:29,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:59:29,941 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:59:29,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:59:29,948 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:59:29,950 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:59:29,952 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:59:29,953 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:59:29,956 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:59:29,956 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:59:29,956 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:59:29,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:59:29,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:59:29,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:59:29,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:59:29,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:59:29,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:59:29,962 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:59:29,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:59:29,965 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:59:29,966 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:59:29,966 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:59:29,967 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:59:29,987 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:59:29,987 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:59:29,988 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:59:29,988 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:59:29,988 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:59:29,988 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:59:29,989 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:59:29,991 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:59:29,991 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:59:29,991 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:59:29,991 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:59:29,992 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:59:29,992 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:59:29,992 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:59:29,992 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:59:29,996 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:59:29,996 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:59:29,996 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:59:29,997 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:59:29,997 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:59:29,997 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:59:29,997 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:59:29,997 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:59:29,998 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:59:29,998 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:59:29,998 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:59:29,998 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:59:29,998 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:59:29,998 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:59:30,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:59:30,003 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:59:30,003 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:59:30,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:59:30,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:59:30,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:59:30,004 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:59:30,004 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:59:30,004 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:59:30,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:59:30,004 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:59:30,005 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:59:30,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:59:30,052 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:59:30,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:59:30,061 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:59:30,062 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:59:30,062 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl [2018-12-03 16:59:30,063 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/doubleLoopUniformIterations.bpl' [2018-12-03 16:59:30,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:59:30,106 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:59:30,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:59:30,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:59:30,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:59:30,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... [2018-12-03 16:59:30,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... [2018-12-03 16:59:30,147 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:59:30,148 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:59:30,148 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:59:30,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:59:30,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:59:30,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:59:30,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:59:30,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... [2018-12-03 16:59:30,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... [2018-12-03 16:59:30,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... [2018-12-03 16:59:30,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... [2018-12-03 16:59:30,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... [2018-12-03 16:59:30,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... [2018-12-03 16:59:30,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... [2018-12-03 16:59:30,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:59:30,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:59:30,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:59:30,184 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:59:30,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:59:30,256 INFO L130 BoogieDeclarations]: Found specification of procedure Main [2018-12-03 16:59:30,257 INFO L138 BoogieDeclarations]: Found implementation of procedure Main [2018-12-03 16:59:30,486 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:59:30,486 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:59:30,487 INFO L202 PluginConnector]: Adding new model doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:59:30 BoogieIcfgContainer [2018-12-03 16:59:30,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:59:30,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:59:30,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:59:30,491 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:59:30,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:59:30" (1/2) ... [2018-12-03 16:59:30,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dbd0998 and model type doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:59:30, skipping insertion in model container [2018-12-03 16:59:30,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "doubleLoopUniformIterations.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:59:30" (2/2) ... [2018-12-03 16:59:30,495 INFO L112 eAbstractionObserver]: Analyzing ICFG doubleLoopUniformIterations.bpl [2018-12-03 16:59:30,505 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:59:30,516 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-03 16:59:30,535 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-03 16:59:30,582 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:59:30,583 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:59:30,583 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:59:30,583 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:59:30,583 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:59:30,583 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:59:30,584 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:59:30,584 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:59:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 16:59:30,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:59:30,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:30,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:59:30,620 INFO L423 AbstractCegarLoop]: === Iteration 1 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:30,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:30,629 INFO L82 PathProgramCache]: Analyzing trace with hash 926725, now seen corresponding path program 1 times [2018-12-03 16:59:30,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:30,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:30,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:30,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:30,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:30,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:59:30,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 16:59:30,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:59:30,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:59:30,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:59:30,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:59:30,783 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-03 16:59:30,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:30,862 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-03 16:59:30,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:59:30,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 16:59:30,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:30,875 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:59:30,875 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:59:30,879 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 16:59:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:59:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:59:30,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:59:30,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-03 16:59:30,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 4 [2018-12-03 16:59:30,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:30,916 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-03 16:59:30,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:59:30,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-03 16:59:30,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:59:30,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:30,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:59:30,917 INFO L423 AbstractCegarLoop]: === Iteration 2 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:30,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:30,917 INFO L82 PathProgramCache]: Analyzing trace with hash 28728519, now seen corresponding path program 1 times [2018-12-03 16:59:30,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:30,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:30,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:30,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:59:30,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 16:59:30,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:59:30,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:59:30,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:59:30,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:59:30,943 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 3 states. [2018-12-03 16:59:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:30,984 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 16:59:30,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:59:30,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 16:59:30,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:30,986 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:59:30,986 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:59:30,987 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 16:59:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:59:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:59:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:59:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-03 16:59:30,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-03 16:59:31,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:31,000 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-03 16:59:31,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:59:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-03 16:59:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:59:31,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:31,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 16:59:31,005 INFO L423 AbstractCegarLoop]: === Iteration 3 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:31,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:31,006 INFO L82 PathProgramCache]: Analyzing trace with hash 891297133, now seen corresponding path program 1 times [2018-12-03 16:59:31,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:31,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:31,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:31,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:31,011 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:31,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:31,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:59:31,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:59:31,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:59:31,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:59:31,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:59:31,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:59:31,123 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-03 16:59:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:31,176 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-03 16:59:31,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:59:31,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 16:59:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:31,177 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:59:31,177 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:59:31,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:59:31,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:59:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:59:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:59:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-03 16:59:31,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-03 16:59:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:31,182 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-03 16:59:31,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:59:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-03 16:59:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:59:31,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:31,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:59:31,183 INFO L423 AbstractCegarLoop]: === Iteration 4 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:31,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:31,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1860345825, now seen corresponding path program 1 times [2018-12-03 16:59:31,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:31,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:31,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:31,185 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:31,294 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 16:59:31,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:31,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:31,295 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 16:59:31,297 INFO L205 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13] [2018-12-03 16:59:31,338 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:59:31,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:59:31,498 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:59:31,499 INFO L272 AbstractInterpreter]: Visited 7 different actions 21 times. Merged at 5 different actions 8 times. Widened at 1 different actions 1 times. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:59:31,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:31,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:59:31,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:31,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:31,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:31,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:31,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:31,668 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 16:59:31,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:31,724 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 16:59:31,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:31,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2018-12-03 16:59:31,755 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:31,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:59:31,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:59:31,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:59:31,756 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-12-03 16:59:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:31,837 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-03 16:59:31,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:59:31,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 16:59:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:31,839 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:59:31,839 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:59:31,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:59:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:59:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-03 16:59:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:59:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-03 16:59:31,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2018-12-03 16:59:31,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:31,848 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-03 16:59:31,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:59:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2018-12-03 16:59:31,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:59:31,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:31,849 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:59:31,850 INFO L423 AbstractCegarLoop]: === Iteration 5 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:31,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:31,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1836084205, now seen corresponding path program 2 times [2018-12-03 16:59:31,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:31,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:31,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:31,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:31,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:31,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:31,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:31,950 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:31,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:31,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:31,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:31,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:31,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:32,000 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:59:32,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:32,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:32,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:32,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:32,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:32,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-03 16:59:32,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:32,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:59:32,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:59:32,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:59:32,157 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 5 states. [2018-12-03 16:59:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:32,331 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-03 16:59:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:59:32,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-03 16:59:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:32,333 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:59:32,334 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:59:32,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:59:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:59:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:59:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:59:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 16:59:32,338 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 8 [2018-12-03 16:59:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:32,340 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 16:59:32,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:59:32,340 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 16:59:32,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:59:32,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:32,341 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 16:59:32,341 INFO L423 AbstractCegarLoop]: === Iteration 6 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:32,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1860095751, now seen corresponding path program 3 times [2018-12-03 16:59:32,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:32,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:32,343 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:32,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:32,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:32,413 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:32,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:32,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:32,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:32,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:32,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:32,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:32,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:32,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:32,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:32,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:32,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:32,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-03 16:59:32,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:32,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:59:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:59:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:59:32,523 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-03 16:59:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:32,591 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 16:59:32,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:59:32,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-03 16:59:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:32,592 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:59:32,593 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:59:32,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:59:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:59:32,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:59:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:59:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 16:59:32,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 8 [2018-12-03 16:59:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:32,597 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 16:59:32,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:59:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 16:59:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:59:32,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:32,598 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:59:32,598 INFO L423 AbstractCegarLoop]: === Iteration 7 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:32,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:32,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1828331911, now seen corresponding path program 4 times [2018-12-03 16:59:32,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:32,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:32,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:32,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:32,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:32,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:32,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:32,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:32,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:32,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:32,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:32,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:32,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:32,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:32,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:32,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:32,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2018-12-03 16:59:32,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:32,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:59:32,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:59:32,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:59:32,851 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2018-12-03 16:59:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:32,940 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 16:59:32,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:59:32,941 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-03 16:59:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:32,942 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:59:32,942 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:59:32,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:59:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:59:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-12-03 16:59:32,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:59:32,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 16:59:32,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-12-03 16:59:32,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:32,947 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 16:59:32,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:59:32,947 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 16:59:32,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:59:32,948 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:32,948 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-12-03 16:59:32,948 INFO L423 AbstractCegarLoop]: === Iteration 8 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:32,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:32,949 INFO L82 PathProgramCache]: Analyzing trace with hash 843652871, now seen corresponding path program 5 times [2018-12-03 16:59:32,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:32,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:32,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:32,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:32,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:33,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:33,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:33,018 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:33,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:33,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:33,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:33,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:33,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:33,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:59:33,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:33,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:33,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:33,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:33,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:33,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 16:59:33,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:33,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:59:33,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:59:33,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:59:33,119 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 6 states. [2018-12-03 16:59:33,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:33,151 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-12-03 16:59:33,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:59:33,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-03 16:59:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:33,153 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:59:33,153 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:59:33,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:59:33,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:59:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:59:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:59:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-03 16:59:33,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 10 [2018-12-03 16:59:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:33,157 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-03 16:59:33,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:59:33,157 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-03 16:59:33,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:59:33,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:33,158 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1] [2018-12-03 16:59:33,158 INFO L423 AbstractCegarLoop]: === Iteration 9 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:33,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:33,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1588010797, now seen corresponding path program 6 times [2018-12-03 16:59:33,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:33,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:33,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:33,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:33,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:33,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:33,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:33,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:33,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:33,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:33,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:33,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:33,266 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:33,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:33,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:33,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:33,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:33,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:33,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 16:59:33,654 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:33,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:59:33,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:59:33,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:59:33,655 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-03 16:59:33,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:33,678 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-03 16:59:33,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:59:33,680 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-03 16:59:33,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:33,681 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:59:33,681 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:59:33,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:59:33,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:59:33,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:59:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:59:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 16:59:33,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-12-03 16:59:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:33,685 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 16:59:33,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:59:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 16:59:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:59:33,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:33,686 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:59:33,686 INFO L423 AbstractCegarLoop]: === Iteration 10 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:33,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:33,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1983632929, now seen corresponding path program 7 times [2018-12-03 16:59:33,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:33,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:33,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:33,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:33,853 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 16:59:33,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:33,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:33,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:33,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:33,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:33,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:33,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:33,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:33,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:33,887 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 16:59:33,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:33,913 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 16:59:33,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:33,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-03 16:59:33,943 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:33,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:59:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:59:33,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:59:33,945 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2018-12-03 16:59:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:34,001 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-12-03 16:59:34,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:59:34,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-03 16:59:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:34,003 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:59:34,003 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:59:34,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:59:34,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:59:34,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-12-03 16:59:34,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:59:34,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 16:59:34,009 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2018-12-03 16:59:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:34,009 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 16:59:34,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:59:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 16:59:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:59:34,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:34,010 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-12-03 16:59:34,010 INFO L423 AbstractCegarLoop]: === Iteration 11 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:34,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1363017133, now seen corresponding path program 8 times [2018-12-03 16:59:34,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:34,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:34,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:34,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:34,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:34,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:34,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:34,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:34,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:34,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:34,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:34,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:34,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:34,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:59:34,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:34,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:34,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:34,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:34,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:59:34,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:34,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:59:34,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:59:34,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:59:34,360 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 7 states. [2018-12-03 16:59:34,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:34,399 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-12-03 16:59:34,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:59:34,399 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 16:59:34,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:34,400 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:59:34,400 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:59:34,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:59:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:59:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:59:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:59:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-03 16:59:34,405 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 12 [2018-12-03 16:59:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:34,405 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-03 16:59:34,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:59:34,405 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-03 16:59:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:59:34,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:34,406 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2018-12-03 16:59:34,406 INFO L423 AbstractCegarLoop]: === Iteration 12 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:34,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:34,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1331690937, now seen corresponding path program 9 times [2018-12-03 16:59:34,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:34,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:34,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:34,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:34,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:34,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:34,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:34,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:34,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:34,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:34,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:34,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:34,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:34,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:34,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:34,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:34,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:34,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:59:34,637 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:34,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:59:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:59:34,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:59:34,638 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-03 16:59:34,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:34,709 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-03 16:59:34,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:59:34,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 16:59:34,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:34,710 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:59:34,710 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:59:34,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:59:34,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:59:34,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:59:34,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:59:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-12-03 16:59:34,714 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2018-12-03 16:59:34,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:34,715 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-12-03 16:59:34,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:59:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-12-03 16:59:34,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:59:34,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:34,715 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2018-12-03 16:59:34,716 INFO L423 AbstractCegarLoop]: === Iteration 13 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:34,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:34,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1667192391, now seen corresponding path program 10 times [2018-12-03 16:59:34,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:34,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:34,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:34,870 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 16:59:34,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:34,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:34,871 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:34,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:34,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:34,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:34,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:34,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:34,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:34,911 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 16:59:34,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:34,925 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 16:59:34,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:34,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 16:59:34,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:34,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:59:34,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:59:34,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:59:34,946 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2018-12-03 16:59:35,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:35,076 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-12-03 16:59:35,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:59:35,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 13 [2018-12-03 16:59:35,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:35,077 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:59:35,078 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:59:35,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:59:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:59:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2018-12-03 16:59:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:59:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 16:59:35,082 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2018-12-03 16:59:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:35,082 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 16:59:35,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:59:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 16:59:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:59:35,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:35,083 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-12-03 16:59:35,083 INFO L423 AbstractCegarLoop]: === Iteration 14 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:35,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:35,084 INFO L82 PathProgramCache]: Analyzing trace with hash 143295047, now seen corresponding path program 11 times [2018-12-03 16:59:35,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:35,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:35,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:35,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:35,247 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:35,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:35,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:35,247 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:35,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:35,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:35,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:59:35,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:35,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:35,346 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:35,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:59:35,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:35,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:59:35,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:59:35,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:59:35,366 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 8 states. [2018-12-03 16:59:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:35,401 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-03 16:59:35,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:59:35,402 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-03 16:59:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:35,403 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:59:35,403 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:59:35,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:59:35,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:59:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:59:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:59:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 16:59:35,407 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-12-03 16:59:35,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:35,407 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 16:59:35,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:59:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 16:59:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:59:35,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:35,408 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1] [2018-12-03 16:59:35,408 INFO L423 AbstractCegarLoop]: === Iteration 15 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:35,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:35,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1788276499, now seen corresponding path program 12 times [2018-12-03 16:59:35,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:35,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,410 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:35,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:35,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:35,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:35,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:35,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:35,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:35,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:35,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:35,499 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:35,499 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:35,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:35,615 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:35,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:35,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:59:35,634 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:35,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:59:35,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:59:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:59:35,635 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-03 16:59:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:35,683 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-03 16:59:35,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:59:35,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-03 16:59:35,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:35,684 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:59:35,684 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:59:35,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:59:35,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:59:35,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:59:35,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:59:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-03 16:59:35,688 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-03 16:59:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:35,688 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-03 16:59:35,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:59:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-03 16:59:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:59:35,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:35,689 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1] [2018-12-03 16:59:35,689 INFO L423 AbstractCegarLoop]: === Iteration 16 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:35,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:35,689 INFO L82 PathProgramCache]: Analyzing trace with hash 397941857, now seen corresponding path program 13 times [2018-12-03 16:59:35,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:35,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:35,810 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 16:59:35,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:35,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:35,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:35,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:35,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:35,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:35,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:35,822 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:35,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:35,845 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 16:59:35,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:35,891 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 16:59:35,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:35,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:59:35,915 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:35,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:59:35,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:59:35,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:59:35,916 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 8 states. [2018-12-03 16:59:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:36,000 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-12-03 16:59:36,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:59:36,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-12-03 16:59:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:36,007 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:59:36,007 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:59:36,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:59:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:59:36,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-12-03 16:59:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:59:36,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 16:59:36,014 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2018-12-03 16:59:36,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:36,014 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 16:59:36,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:59:36,014 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 16:59:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:59:36,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:36,015 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-12-03 16:59:36,015 INFO L423 AbstractCegarLoop]: === Iteration 17 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:36,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:36,015 INFO L82 PathProgramCache]: Analyzing trace with hash -548765843, now seen corresponding path program 14 times [2018-12-03 16:59:36,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:36,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:36,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:36,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:36,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:36,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:36,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:36,119 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:36,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:36,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:36,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:36,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:36,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:36,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:59:36,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:36,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:36,154 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:36,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:36,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:36,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 16:59:36,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:36,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:59:36,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:59:36,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:59:36,298 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 9 states. [2018-12-03 16:59:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:36,345 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-12-03 16:59:36,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:59:36,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:59:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:36,346 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:59:36,346 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:59:36,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 12 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:59:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:59:36,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:59:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:59:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-03 16:59:36,349 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 16 [2018-12-03 16:59:36,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:36,350 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-03 16:59:36,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:59:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-03 16:59:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:59:36,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:36,351 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1] [2018-12-03 16:59:36,351 INFO L423 AbstractCegarLoop]: === Iteration 18 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:36,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash -297941625, now seen corresponding path program 15 times [2018-12-03 16:59:36,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:36,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:36,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:36,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:36,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:36,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:36,528 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:36,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:36,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:36,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:36,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:36,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:36,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:36,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:36,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:36,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:37,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 16:59:37,153 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:37,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:59:37,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:59:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:59:37,154 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-03 16:59:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:37,211 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-03 16:59:37,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:59:37,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:59:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:37,212 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:59:37,213 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:59:37,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 12 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:59:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:59:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:59:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:59:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-12-03 16:59:37,217 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-12-03 16:59:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:37,217 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-12-03 16:59:37,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:59:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-12-03 16:59:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:59:37,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:37,218 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1] [2018-12-03 16:59:37,218 INFO L423 AbstractCegarLoop]: === Iteration 19 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:37,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:37,218 INFO L82 PathProgramCache]: Analyzing trace with hash -646317305, now seen corresponding path program 16 times [2018-12-03 16:59:37,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:37,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:37,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:37,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:37,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:37,344 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 16:59:37,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:37,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:37,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:37,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:37,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:37,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:37,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:37,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:37,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:37,437 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 16:59:37,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:37,489 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 16:59:37,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:37,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:59:37,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:37,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:59:37,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:59:37,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:59:37,524 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 9 states. [2018-12-03 16:59:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:37,727 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-12-03 16:59:37,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:59:37,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-12-03 16:59:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:37,728 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:59:37,728 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:59:37,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:59:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:59:37,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 20. [2018-12-03 16:59:37,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:37,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 16:59:37,733 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-12-03 16:59:37,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:37,733 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 16:59:37,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:59:37,734 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 16:59:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:59:37,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:37,734 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-12-03 16:59:37,735 INFO L423 AbstractCegarLoop]: === Iteration 20 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:37,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1438938503, now seen corresponding path program 17 times [2018-12-03 16:59:37,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:37,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:37,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:37,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:37,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:37,815 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:37,815 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:37,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:37,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:37,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:37,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:37,825 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:37,838 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:37,838 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:37,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:37,848 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:38,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:38,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 16:59:38,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:38,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:59:38,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:59:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:59:38,047 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 10 states. [2018-12-03 16:59:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:38,119 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-12-03 16:59:38,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:59:38,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 16:59:38,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:38,120 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:59:38,120 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:59:38,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:59:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:59:38,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:59:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:59:38,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 16:59:38,124 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 18 [2018-12-03 16:59:38,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:38,124 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 16:59:38,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:59:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 16:59:38,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:59:38,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:38,125 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1] [2018-12-03 16:59:38,125 INFO L423 AbstractCegarLoop]: === Iteration 21 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:38,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:38,126 INFO L82 PathProgramCache]: Analyzing trace with hash 624554669, now seen corresponding path program 18 times [2018-12-03 16:59:38,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:38,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:38,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:38,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:38,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:38,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:38,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:38,229 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:38,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:38,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:38,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:38,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:38,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:38,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:38,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:38,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:38,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:38,550 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:38,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:38,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 16:59:38,571 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:38,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:59:38,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:59:38,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:59:38,572 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-03 16:59:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:38,619 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-03 16:59:38,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:59:38,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 16:59:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:38,620 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:59:38,620 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:59:38,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:59:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:59:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:59:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:59:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-03 16:59:38,624 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-12-03 16:59:38,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:38,624 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-03 16:59:38,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:59:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-03 16:59:38,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:59:38,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:38,625 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1] [2018-12-03 16:59:38,625 INFO L423 AbstractCegarLoop]: === Iteration 22 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:38,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:38,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2113703263, now seen corresponding path program 19 times [2018-12-03 16:59:38,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:38,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:38,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:38,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:38,770 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 16:59:38,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:38,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:38,770 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:38,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:38,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:38,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:38,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:38,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:38,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:38,829 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 16:59:38,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:38,849 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 16:59:38,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:38,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 16:59:38,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:38,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:59:38,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:59:38,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:59:38,869 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 10 states. [2018-12-03 16:59:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:39,098 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-12-03 16:59:39,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:59:39,100 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-12-03 16:59:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:39,100 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:59:39,100 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:59:39,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:59:39,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:59:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-12-03 16:59:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:59:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-12-03 16:59:39,108 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-12-03 16:59:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:39,109 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-12-03 16:59:39,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:59:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-12-03 16:59:39,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:59:39,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:39,110 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-12-03 16:59:39,110 INFO L423 AbstractCegarLoop]: === Iteration 23 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:39,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:39,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1100353235, now seen corresponding path program 20 times [2018-12-03 16:59:39,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:39,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:39,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:39,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:39,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:39,367 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:39,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:39,368 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:39,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:39,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:39,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:39,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:39,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:39,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:59:39,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:39,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:39,404 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:39,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-03 16:59:39,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:39,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:39,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:59:39,596 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 11 states. [2018-12-03 16:59:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:39,637 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-12-03 16:59:39,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:39,637 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:59:39,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:39,638 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:59:39,638 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:59:39,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:59:39,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:59:39,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:59:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:59:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 16:59:39,644 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 20 [2018-12-03 16:59:39,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:39,644 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 16:59:39,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:39,644 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 16:59:39,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:59:39,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:39,645 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1] [2018-12-03 16:59:39,645 INFO L423 AbstractCegarLoop]: === Iteration 24 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:39,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:39,645 INFO L82 PathProgramCache]: Analyzing trace with hash -576448313, now seen corresponding path program 21 times [2018-12-03 16:59:39,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:39,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:39,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:39,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:39,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:39,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:39,883 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:39,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:39,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:39,884 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:39,892 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:39,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:39,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:39,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:39,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:40,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:40,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-03 16:59:40,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:40,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:40,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:40,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:59:40,085 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-03 16:59:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:40,116 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-03 16:59:40,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:40,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 16:59:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:40,117 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:59:40,117 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:59:40,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:59:40,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:59:40,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:59:40,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:59:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-12-03 16:59:40,122 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 20 [2018-12-03 16:59:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:40,122 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-12-03 16:59:40,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-12-03 16:59:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:59:40,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:40,123 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2018-12-03 16:59:40,124 INFO L423 AbstractCegarLoop]: === Iteration 25 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:40,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:40,124 INFO L82 PathProgramCache]: Analyzing trace with hash -690090041, now seen corresponding path program 22 times [2018-12-03 16:59:40,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:40,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:40,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:40,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:40,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:40,394 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 16:59:40,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:40,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:40,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:40,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:40,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:40,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:40,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:40,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:40,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:40,424 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 16:59:40,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:40,431 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 16:59:40,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:40,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 16:59:40,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:40,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:59:40,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:59:40,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:59:40,456 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 11 states. [2018-12-03 16:59:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:40,581 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-12-03 16:59:40,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:59:40,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2018-12-03 16:59:40,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:40,583 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:59:40,583 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:59:40,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:59:40,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:59:40,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-12-03 16:59:40,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:59:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 16:59:40,588 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2018-12-03 16:59:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:40,588 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 16:59:40,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:59:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 16:59:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:59:40,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:40,589 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-12-03 16:59:40,589 INFO L423 AbstractCegarLoop]: === Iteration 26 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:40,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:40,590 INFO L82 PathProgramCache]: Analyzing trace with hash 81983687, now seen corresponding path program 23 times [2018-12-03 16:59:40,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:40,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:40,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:40,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:40,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:40,690 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:40,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:40,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:40,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:40,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:40,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:40,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:40,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:40,702 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:40,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:59:40,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:40,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:40,766 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:40,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:40,950 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:40,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:40,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 16:59:40,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:40,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:59:40,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:59:40,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:59:40,971 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 12 states. [2018-12-03 16:59:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:41,047 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-03 16:59:41,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:59:41,048 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-03 16:59:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:41,048 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:59:41,049 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:59:41,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 18 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:59:41,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:59:41,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:59:41,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:59:41,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-03 16:59:41,054 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 22 [2018-12-03 16:59:41,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:41,054 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-03 16:59:41,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:59:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-03 16:59:41,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:59:41,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:41,055 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1] [2018-12-03 16:59:41,055 INFO L423 AbstractCegarLoop]: === Iteration 27 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:41,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:41,056 INFO L82 PathProgramCache]: Analyzing trace with hash -856832915, now seen corresponding path program 24 times [2018-12-03 16:59:41,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:41,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:41,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:41,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:41,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:41,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:41,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:41,194 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:41,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:41,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:41,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:41,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:41,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:41,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:41,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:41,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:41,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:41,379 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:41,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:41,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 16:59:41,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:41,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:59:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:59:41,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:59:41,400 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-03 16:59:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:41,451 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-03 16:59:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:59:41,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-03 16:59:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:41,452 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:59:41,452 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:59:41,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 18 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:59:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:59:41,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:59:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:59:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-03 16:59:41,456 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-12-03 16:59:41,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:41,456 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-03 16:59:41,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:59:41,456 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-03 16:59:41,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:59:41,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:41,457 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1] [2018-12-03 16:59:41,457 INFO L423 AbstractCegarLoop]: === Iteration 28 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:41,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:41,458 INFO L82 PathProgramCache]: Analyzing trace with hash -792078111, now seen corresponding path program 25 times [2018-12-03 16:59:41,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:41,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:41,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:41,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:41,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:41,804 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 16:59:41,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:41,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:41,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:41,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:41,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:41,805 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:41,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:41,814 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:41,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:41,841 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 16:59:41,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:41,848 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 16:59:41,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:41,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-03 16:59:41,878 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:41,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:59:41,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:59:41,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:59:41,879 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 12 states. [2018-12-03 16:59:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:42,240 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-12-03 16:59:42,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:59:42,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2018-12-03 16:59:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:42,241 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:59:42,241 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:59:42,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:59:42,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:59:42,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-12-03 16:59:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:59:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 16:59:42,243 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2018-12-03 16:59:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:42,244 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 16:59:42,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:59:42,244 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 16:59:42,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:59:42,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:42,244 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-12-03 16:59:42,245 INFO L423 AbstractCegarLoop]: === Iteration 29 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:42,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:42,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1215320813, now seen corresponding path program 26 times [2018-12-03 16:59:42,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:42,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:42,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:42,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:42,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:42,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:42,400 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:42,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:42,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:42,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:42,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:42,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:42,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:59:42,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:42,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:42,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:42,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:42,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-03 16:59:42,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:42,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:59:42,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:59:42,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:59:42,600 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 13 states. [2018-12-03 16:59:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:42,656 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-12-03 16:59:42,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:59:42,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 16:59:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:42,656 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:59:42,656 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:59:42,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 20 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:59:42,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:59:42,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:59:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:59:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 16:59:42,660 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 24 [2018-12-03 16:59:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:42,660 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 16:59:42,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:59:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 16:59:42,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:59:42,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:42,661 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1] [2018-12-03 16:59:42,661 INFO L423 AbstractCegarLoop]: === Iteration 30 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:42,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:42,661 INFO L82 PathProgramCache]: Analyzing trace with hash -2118190073, now seen corresponding path program 27 times [2018-12-03 16:59:42,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:42,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:42,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:42,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:42,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:42,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:42,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:42,772 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:42,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:42,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:42,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:42,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:42,783 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:42,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:42,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:42,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:42,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 55 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:42,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:42,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-03 16:59:42,941 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:42,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:59:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:59:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:59:42,942 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-03 16:59:42,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:42,975 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-12-03 16:59:42,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:59:42,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 16:59:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:42,976 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:59:42,976 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:59:42,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 20 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:59:42,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:59:42,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:59:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:59:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-12-03 16:59:42,981 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 24 [2018-12-03 16:59:42,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:42,981 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-12-03 16:59:42,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:59:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-12-03 16:59:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:59:42,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:42,982 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2018-12-03 16:59:42,982 INFO L423 AbstractCegarLoop]: === Iteration 31 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:42,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:42,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1239444345, now seen corresponding path program 28 times [2018-12-03 16:59:42,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:42,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:42,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:42,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:42,983 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:43,686 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 16:59:43,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:43,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:43,686 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:43,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:43,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:43,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:43,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:43,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:43,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:43,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:43,718 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 16:59:43,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:43,775 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 16:59:43,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:43,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 16:59:43,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:43,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:59:43,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:59:43,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:59:43,810 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 13 states. [2018-12-03 16:59:44,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:44,155 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-12-03 16:59:44,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:59:44,156 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-12-03 16:59:44,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:44,156 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:59:44,156 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:59:44,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:59:44,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:59:44,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-12-03 16:59:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:59:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 16:59:44,161 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2018-12-03 16:59:44,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:44,161 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 16:59:44,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:59:44,162 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 16:59:44,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:59:44,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:44,162 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-12-03 16:59:44,162 INFO L423 AbstractCegarLoop]: === Iteration 32 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:44,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:44,163 INFO L82 PathProgramCache]: Analyzing trace with hash 231869447, now seen corresponding path program 29 times [2018-12-03 16:59:44,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:44,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:44,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:44,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:44,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:44,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:44,305 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:44,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:59:44,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:44,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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:44,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:44,316 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:44,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:59:44,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:44,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:44,350 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:44,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:44,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:44,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 16:59:44,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:44,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:59:44,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:59:44,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:59:44,553 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2018-12-03 16:59:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:44,630 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-03 16:59:44,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:59:44,631 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-03 16:59:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:44,632 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:59:44,632 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:59:44,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 22 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:59:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:59:44,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:59:44,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:59:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 16:59:44,637 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2018-12-03 16:59:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:44,637 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 16:59:44,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:59:44,637 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 16:59:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:59:44,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:44,638 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1] [2018-12-03 16:59:44,638 INFO L423 AbstractCegarLoop]: === Iteration 33 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:44,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:44,639 INFO L82 PathProgramCache]: Analyzing trace with hash -27752915, now seen corresponding path program 30 times [2018-12-03 16:59:44,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:44,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:44,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:44,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:44,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:44,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:44,816 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:44,817 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:44,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:44,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:44,817 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:44,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:44,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:44,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:44,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:44,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:44,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:45,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:45,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 16:59:45,008 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:45,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:59:45,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:59:45,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:59:45,010 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-03 16:59:45,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:45,086 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-03 16:59:45,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:59:45,087 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-03 16:59:45,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:45,087 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:59:45,087 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:59:45,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 39 SyntacticMatches, 22 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:59:45,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:59:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:59:45,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:59:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-03 16:59:45,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-03 16:59:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:45,093 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-03 16:59:45,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:59:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-03 16:59:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:59:45,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:45,094 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1] [2018-12-03 16:59:45,094 INFO L423 AbstractCegarLoop]: === Iteration 34 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:45,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:45,095 INFO L82 PathProgramCache]: Analyzing trace with hash -860401887, now seen corresponding path program 31 times [2018-12-03 16:59:45,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:45,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:45,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:45,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:45,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:45,274 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 16:59:45,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:45,274 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:45,274 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:45,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:45,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:45,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:45,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:45,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:45,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:45,306 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 16:59:45,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:45,321 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 16:59:45,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:45,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-03 16:59:45,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:45,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:59:45,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:59:45,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:59:45,342 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-12-03 16:59:45,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:45,591 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-03 16:59:45,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:59:45,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-03 16:59:45,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:45,592 INFO L225 Difference]: With dead ends: 44 [2018-12-03 16:59:45,593 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:59:45,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:59:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:59:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-12-03 16:59:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:59:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-03 16:59:45,597 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 27 [2018-12-03 16:59:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:45,597 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-03 16:59:45,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:59:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-03 16:59:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:59:45,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:45,598 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-12-03 16:59:45,598 INFO L423 AbstractCegarLoop]: === Iteration 35 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:45,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash -902716243, now seen corresponding path program 32 times [2018-12-03 16:59:45,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:45,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:45,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:45,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:45,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:45,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:45,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:45,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:45,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:45,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:45,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:45,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:45,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:59:45,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:45,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:45,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:46,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:46,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-03 16:59:46,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:46,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:59:46,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:59:46,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:59:46,125 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 15 states. [2018-12-03 16:59:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:46,193 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-12-03 16:59:46,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:59:46,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-03 16:59:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:46,195 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:59:46,195 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:59:46,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 24 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:59:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:59:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:59:46,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:59:46,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-03 16:59:46,201 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 28 [2018-12-03 16:59:46,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:46,201 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-03 16:59:46,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:59:46,202 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-03 16:59:46,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:59:46,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:46,202 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1] [2018-12-03 16:59:46,202 INFO L423 AbstractCegarLoop]: === Iteration 36 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:46,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:46,203 INFO L82 PathProgramCache]: Analyzing trace with hash -361074873, now seen corresponding path program 33 times [2018-12-03 16:59:46,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:46,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:46,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:46,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:46,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:46,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:46,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:46,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:46,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 16:59:46,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:46,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:46,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:46,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:46,652 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:46,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:46,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:46,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:46,874 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 78 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:46,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:46,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-03 16:59:46,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:46,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:59:46,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:59:46,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:59:46,894 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-03 16:59:47,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:47,206 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-12-03 16:59:47,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:59:47,207 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-03 16:59:47,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:47,207 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:59:47,207 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:59:47,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 24 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:59:47,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:59:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:59:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:59:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-03 16:59:47,211 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 28 [2018-12-03 16:59:47,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:47,212 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-03 16:59:47,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:59:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-03 16:59:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:59:47,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:47,213 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1] [2018-12-03 16:59:47,213 INFO L423 AbstractCegarLoop]: === Iteration 37 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:47,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1691519303, now seen corresponding path program 34 times [2018-12-03 16:59:47,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:47,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:47,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:47,627 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 16:59:47,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:47,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:47,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:47,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:47,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:47,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:47,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:47,636 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:47,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:47,665 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 16:59:47,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:47,725 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 16:59:47,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:47,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 16:59:47,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:47,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:59:47,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:59:47,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:59:47,769 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 15 states. [2018-12-03 16:59:48,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:48,134 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-12-03 16:59:48,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:59:48,134 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-12-03 16:59:48,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:48,135 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:59:48,135 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:59:48,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 65 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:59:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:59:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2018-12-03 16:59:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:59:48,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-03 16:59:48,139 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 29 [2018-12-03 16:59:48,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:48,139 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-03 16:59:48,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:59:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-03 16:59:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:59:48,140 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:48,140 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-12-03 16:59:48,140 INFO L423 AbstractCegarLoop]: === Iteration 38 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:48,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:48,141 INFO L82 PathProgramCache]: Analyzing trace with hash 897429319, now seen corresponding path program 35 times [2018-12-03 16:59:48,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:48,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:48,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:48,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:48,142 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:48,421 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:48,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:48,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:48,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:48,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:48,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:48,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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:48,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:48,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:48,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:59:48,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:48,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:48,457 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:48,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:48,678 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:48,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:48,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 16:59:48,696 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:48,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:59:48,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:59:48,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:59:48,697 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 16 states. [2018-12-03 16:59:48,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:48,771 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-12-03 16:59:48,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:59:48,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-03 16:59:48,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:48,772 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:59:48,773 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:59:48,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 26 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:59:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:59:48,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:59:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:59:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-03 16:59:48,776 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 30 [2018-12-03 16:59:48,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:48,776 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-03 16:59:48,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:59:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-03 16:59:48,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:59:48,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:48,777 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1] [2018-12-03 16:59:48,777 INFO L423 AbstractCegarLoop]: === Iteration 39 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:48,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:48,777 INFO L82 PathProgramCache]: Analyzing trace with hash 508442605, now seen corresponding path program 36 times [2018-12-03 16:59:48,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:48,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:48,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:48,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:48,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:49,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:49,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:49,355 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:49,355 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:49,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:49,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:49,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:49,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:49,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:49,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:49,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:49,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:49,537 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:49,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:49,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 16:59:49,556 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:49,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:59:49,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:59:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:59:49,557 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-03 16:59:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:49,603 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-03 16:59:49,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:59:49,603 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-03 16:59:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:49,604 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:59:49,604 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:59:49,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 45 SyntacticMatches, 26 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:59:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:59:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:59:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:59:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-03 16:59:49,607 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-12-03 16:59:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:49,608 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-03 16:59:49,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:59:49,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-03 16:59:49,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:59:49,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:49,608 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1] [2018-12-03 16:59:49,608 INFO L423 AbstractCegarLoop]: === Iteration 40 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:49,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:49,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1418209951, now seen corresponding path program 37 times [2018-12-03 16:59:49,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:49,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:49,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:49,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:49,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:49,811 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 16:59:49,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:49,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:49,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:49,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:49,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:49,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:49,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:49,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:49,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:49,845 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 16:59:49,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:49,892 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 16:59:49,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:49,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-03 16:59:49,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:49,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:59:49,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:59:49,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:59:49,926 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2018-12-03 16:59:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:50,602 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-12-03 16:59:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:59:50,602 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-12-03 16:59:50,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:50,603 INFO L225 Difference]: With dead ends: 50 [2018-12-03 16:59:50,603 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:59:50,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:59:50,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:59:50,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-12-03 16:59:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:59:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-12-03 16:59:50,607 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 31 [2018-12-03 16:59:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:50,608 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-12-03 16:59:50,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:59:50,608 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-12-03 16:59:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:59:50,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:50,608 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-12-03 16:59:50,608 INFO L423 AbstractCegarLoop]: === Iteration 41 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:50,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1014897043, now seen corresponding path program 38 times [2018-12-03 16:59:50,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:50,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:50,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:50,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:50,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:51,188 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:51,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:51,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:51,188 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:51,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:51,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:51,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:51,201 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:51,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:51,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:59:51,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:51,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:51,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:51,771 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:51,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:51,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-03 16:59:51,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:51,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:59:51,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:59:51,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:59:51,793 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 17 states. [2018-12-03 16:59:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:51,871 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-12-03 16:59:51,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:59:51,872 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-03 16:59:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:51,872 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:59:51,872 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:59:51,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 28 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:59:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:59:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:59:51,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:59:51,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 16:59:51,876 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 32 [2018-12-03 16:59:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:51,876 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 16:59:51,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:59:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 16:59:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:59:51,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:51,877 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1] [2018-12-03 16:59:51,877 INFO L423 AbstractCegarLoop]: === Iteration 42 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:51,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash -188583289, now seen corresponding path program 39 times [2018-12-03 16:59:51,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:51,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:51,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:51,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:51,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:52,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:52,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:52,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:52,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:52,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:52,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:52,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:52,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:52,071 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:52,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:52,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:52,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 105 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:52,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:52,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-03 16:59:52,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:52,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:59:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:59:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:59:52,680 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-03 16:59:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:52,734 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-12-03 16:59:52,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:59:52,735 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-03 16:59:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:52,736 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:59:52,736 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:59:52,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 28 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:59:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:59:52,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:59:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:59:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-12-03 16:59:52,739 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2018-12-03 16:59:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:52,739 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-12-03 16:59:52,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:59:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-12-03 16:59:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:59:52,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:52,739 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1] [2018-12-03 16:59:52,740 INFO L423 AbstractCegarLoop]: === Iteration 43 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:52,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1551176185, now seen corresponding path program 40 times [2018-12-03 16:59:52,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:52,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:52,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:52,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:52,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:53,026 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 16:59:53,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:53,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:53,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:53,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:53,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:53,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:53,067 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 16:59:53,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:53,088 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 16:59:53,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:53,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 16:59:53,107 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:53,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:59:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:59:53,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:59:53,108 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 17 states. [2018-12-03 16:59:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:53,402 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-12-03 16:59:53,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:59:53,403 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-12-03 16:59:53,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:53,403 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:59:53,404 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:59:53,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:59:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:59:53,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2018-12-03 16:59:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:59:53,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-03 16:59:53,409 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 33 [2018-12-03 16:59:53,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:53,409 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-03 16:59:53,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:59:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-03 16:59:53,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:59:53,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:53,410 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-12-03 16:59:53,410 INFO L423 AbstractCegarLoop]: === Iteration 44 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:53,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash -841883001, now seen corresponding path program 41 times [2018-12-03 16:59:53,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:53,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:53,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:53,554 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:53,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:53,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:53,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:53,568 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:53,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 16:59:53,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:53,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:53,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 16:59:53,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:53,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:59:53,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:59:53,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:59:53,845 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 18 states. [2018-12-03 16:59:53,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:53,921 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-12-03 16:59:53,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:59:53,922 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-03 16:59:53,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:53,922 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:59:53,922 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:59:53,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 30 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:59:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:59:53,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:59:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:59:53,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-03 16:59:53,927 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 34 [2018-12-03 16:59:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:53,927 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-03 16:59:53,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:59:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-03 16:59:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:59:53,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:53,928 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1] [2018-12-03 16:59:53,928 INFO L423 AbstractCegarLoop]: === Iteration 45 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:53,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash -995960403, now seen corresponding path program 42 times [2018-12-03 16:59:53,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:53,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:53,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:53,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:53,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:54,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:54,639 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:54,639 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:54,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 16:59:54,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:54,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:54,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:54,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:54,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:54,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:54,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:54,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 120 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:55,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:55,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 16:59:55,074 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:55,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:59:55,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:59:55,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:59:55,075 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-03 16:59:55,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:55,154 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-03 16:59:55,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:59:55,155 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-03 16:59:55,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:55,155 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:59:55,156 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:59:55,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 51 SyntacticMatches, 30 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:59:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:59:55,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:59:55,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:59:55,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-03 16:59:55,160 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-12-03 16:59:55,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:55,160 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-03 16:59:55,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:59:55,160 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-03 16:59:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:59:55,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:55,161 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1] [2018-12-03 16:59:55,161 INFO L423 AbstractCegarLoop]: === Iteration 46 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:55,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:55,162 INFO L82 PathProgramCache]: Analyzing trace with hash -810062943, now seen corresponding path program 43 times [2018-12-03 16:59:55,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:55,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:55,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:55,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:55,495 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 16:59:55,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:55,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:55,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:55,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:55,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:55,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:55,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:55,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:55,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:55,551 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 16:59:55,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:55,595 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 16:59:55,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:55,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-03 16:59:55,615 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:55,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:59:55,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:59:55,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:59:55,616 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 18 states. [2018-12-03 16:59:56,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:56,011 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-12-03 16:59:56,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:59:56,011 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-12-03 16:59:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:56,012 INFO L225 Difference]: With dead ends: 56 [2018-12-03 16:59:56,012 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:59:56,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:59:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:59:56,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 38. [2018-12-03 16:59:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:59:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-03 16:59:56,015 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 35 [2018-12-03 16:59:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:56,015 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-03 16:59:56,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:59:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-03 16:59:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:59:56,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:56,016 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-12-03 16:59:56,016 INFO L423 AbstractCegarLoop]: === Iteration 47 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:56,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash 657791021, now seen corresponding path program 44 times [2018-12-03 16:59:56,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:56,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:56,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:56,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:56,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:56,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:56,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:56,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:56,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:56,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:56,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:56,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:56,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 16:59:56,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:56,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:56,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:56,842 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:56,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:56,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-03 16:59:56,860 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:56,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:59:56,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:59:56,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:59:56,861 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 19 states. [2018-12-03 16:59:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:56,955 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-12-03 16:59:56,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:59:56,955 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-03 16:59:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:56,956 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:59:56,956 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:59:56,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 32 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:59:56,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:59:56,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:59:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:59:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 16:59:56,961 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 36 [2018-12-03 16:59:56,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:56,961 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 16:59:56,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:59:56,961 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 16:59:56,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:59:56,962 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:56,962 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1] [2018-12-03 16:59:56,962 INFO L423 AbstractCegarLoop]: === Iteration 48 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:56,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:56,962 INFO L82 PathProgramCache]: Analyzing trace with hash 176358855, now seen corresponding path program 45 times [2018-12-03 16:59:56,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:56,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:56,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:56,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:57,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:57,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:57,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:57,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:57,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:57,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:57,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:57,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:57,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:57,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:57,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:57,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 136 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:58,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:58,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-03 16:59:58,306 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:58,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:59:58,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:59:58,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:59:58,307 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-03 16:59:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:58,368 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-12-03 16:59:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:59:58,368 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-03 16:59:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:58,369 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:59:58,369 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:59:58,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 54 SyntacticMatches, 32 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:59:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:59:58,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:59:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:59:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-12-03 16:59:58,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 36 [2018-12-03 16:59:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:58,374 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-12-03 16:59:58,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:59:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-12-03 16:59:58,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:59:58,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:58,375 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1] [2018-12-03 16:59:58,375 INFO L423 AbstractCegarLoop]: === Iteration 49 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:58,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:58,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1172095687, now seen corresponding path program 46 times [2018-12-03 16:59:58,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:58,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:58,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:58,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:58,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:58,620 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 16:59:58,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:58,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:58,621 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:58,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:58,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:58,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:58,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:58,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:58,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:58,665 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 16:59:58,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:58,672 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 16:59:58,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:58,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 16:59:58,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:58,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:59:58,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:59:58,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:59:58,691 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 19 states. [2018-12-03 16:59:59,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:59,360 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-12-03 16:59:59,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:59:59,360 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 37 [2018-12-03 16:59:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:59,361 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:59:59,361 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:59:59,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:59:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:59:59,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2018-12-03 16:59:59,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:59:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-12-03 16:59:59,365 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 37 [2018-12-03 16:59:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:59,366 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-12-03 16:59:59,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:59:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-12-03 16:59:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:59:59,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:59,366 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-12-03 16:59:59,367 INFO L423 AbstractCegarLoop]: === Iteration 50 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:59,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:59,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1975166407, now seen corresponding path program 47 times [2018-12-03 16:59:59,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:59,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:59,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:59,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:59,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:59,628 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:59,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:59,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:59,628 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:59,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:59,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:59,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:59:59,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:59,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:59,679 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:59,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:00,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:00,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 17:00:00,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:00,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:00:00,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:00:00,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:00,024 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 20 states. [2018-12-03 17:00:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:00,115 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-03 17:00:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:00:00,115 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-03 17:00:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:00,116 INFO L225 Difference]: With dead ends: 60 [2018-12-03 17:00:00,116 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:00:00,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 34 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:00:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 17:00:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:00:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-03 17:00:00,120 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 38 [2018-12-03 17:00:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:00,120 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-03 17:00:00,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:00:00,120 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-03 17:00:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:00:00,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:00,121 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1] [2018-12-03 17:00:00,121 INFO L423 AbstractCegarLoop]: === Iteration 51 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:00,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash -64328851, now seen corresponding path program 48 times [2018-12-03 17:00:00,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:00,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:00,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:00,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:00,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:00,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:00,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:00,418 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:00,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:00,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:00,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:00,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:00,428 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:00,446 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:00,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:00,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:00,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:00,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:00,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 17:00:00,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:00,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:00:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:00:00,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:00,711 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-03 17:00:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:00,773 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-03 17:00:00,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:00:00,774 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-03 17:00:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:00,775 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:00:00,775 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 17:00:00,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 57 SyntacticMatches, 34 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:00,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 17:00:00,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 17:00:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:00:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-03 17:00:00,778 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-03 17:00:00,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:00,778 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-03 17:00:00,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:00:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-03 17:00:00,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:00:00,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:00,779 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1] [2018-12-03 17:00:00,779 INFO L423 AbstractCegarLoop]: === Iteration 52 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:00,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1994255903, now seen corresponding path program 49 times [2018-12-03 17:00:00,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:00,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:00,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:00,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:00,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:01,143 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 17:00:01,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:01,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:01,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:01,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:01,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:01,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:01,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:01,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:01,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:01,188 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 17:00:01,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:01,196 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 17:00:01,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:01,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-03 17:00:01,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:01,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:00:01,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:00:01,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:01,215 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 20 states. [2018-12-03 17:00:01,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:01,682 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-12-03 17:00:01,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:00:01,682 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 39 [2018-12-03 17:00:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:01,683 INFO L225 Difference]: With dead ends: 62 [2018-12-03 17:00:01,683 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:00:01,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:00:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:00:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2018-12-03 17:00:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:00:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-03 17:00:01,688 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 39 [2018-12-03 17:00:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:01,688 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-03 17:00:01,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:00:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-03 17:00:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:00:01,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:01,689 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-12-03 17:00:01,689 INFO L423 AbstractCegarLoop]: === Iteration 53 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:01,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:01,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1692452371, now seen corresponding path program 50 times [2018-12-03 17:00:01,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:01,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:01,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:01,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:01,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:01,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:01,975 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:01,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:01,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:01,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:01,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:01,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:01,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:01,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:01,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:02,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:00:02,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:02,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:02,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:02,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:02,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-03 17:00:02,300 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:02,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:00:02,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:00:02,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:00:02,301 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 21 states. [2018-12-03 17:00:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:02,416 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-12-03 17:00:02,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:00:02,417 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-03 17:00:02,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:02,417 INFO L225 Difference]: With dead ends: 63 [2018-12-03 17:00:02,417 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:00:02,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 36 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:00:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:00:02,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 17:00:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:00:02,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-03 17:00:02,421 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 40 [2018-12-03 17:00:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:02,422 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-03 17:00:02,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:00:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-03 17:00:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:00:02,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:02,422 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1] [2018-12-03 17:00:02,423 INFO L423 AbstractCegarLoop]: === Iteration 54 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:02,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:02,423 INFO L82 PathProgramCache]: Analyzing trace with hash -492295929, now seen corresponding path program 51 times [2018-12-03 17:00:02,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:02,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:02,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:02,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:02,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:02,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:02,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:02,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 17:00:02,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:02,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 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 17:00:02,969 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:02,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:02,991 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:02,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:02,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:03,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:03,481 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 171 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:03,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:03,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-03 17:00:03,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:03,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:00:03,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:00:03,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:00:03,500 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-03 17:00:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:03,556 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-12-03 17:00:03,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:00:03,556 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-03 17:00:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:03,557 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:00:03,557 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 17:00:03,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 36 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:00:03,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 17:00:03,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 17:00:03,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:00:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-12-03 17:00:03,561 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 40 [2018-12-03 17:00:03,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:03,561 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-12-03 17:00:03,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:00:03,561 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-12-03 17:00:03,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:00:03,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:03,562 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1] [2018-12-03 17:00:03,562 INFO L423 AbstractCegarLoop]: === Iteration 55 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:03,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:03,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1918633863, now seen corresponding path program 52 times [2018-12-03 17:00:03,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:03,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:03,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:03,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:03,827 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 17:00:03,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:03,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:03,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:03,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 17:00:03,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:03,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:03,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:03,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:03,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:03,904 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 17:00:03,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:03,912 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 17:00:03,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:03,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 17:00:03,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:03,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:00:03,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:00:03,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:00:03,941 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 21 states. [2018-12-03 17:00:04,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:04,487 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-12-03 17:00:04,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:00:04,488 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-12-03 17:00:04,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:04,489 INFO L225 Difference]: With dead ends: 65 [2018-12-03 17:00:04,489 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 17:00:04,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:00:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 17:00:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 44. [2018-12-03 17:00:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:00:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-03 17:00:04,493 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 41 [2018-12-03 17:00:04,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:04,494 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-03 17:00:04,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:00:04,494 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-03 17:00:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:00:04,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:04,494 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-12-03 17:00:04,495 INFO L423 AbstractCegarLoop]: === Iteration 56 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:04,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:04,495 INFO L82 PathProgramCache]: Analyzing trace with hash -651953913, now seen corresponding path program 53 times [2018-12-03 17:00:04,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:04,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:04,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:04,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:04,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:04,756 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:04,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:04,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:04,756 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:04,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:04,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:04,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:04,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:04,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:04,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 17:00:04,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:04,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:04,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:05,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:05,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 17:00:05,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:05,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:00:05,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:00:05,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:00:05,121 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 22 states. [2018-12-03 17:00:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:05,247 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-03 17:00:05,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:00:05,247 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-03 17:00:05,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:05,248 INFO L225 Difference]: With dead ends: 66 [2018-12-03 17:00:05,248 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:00:05,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 63 SyntacticMatches, 38 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:00:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:00:05,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:00:05,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:00:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 17:00:05,252 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 42 [2018-12-03 17:00:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:05,252 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 17:00:05,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:00:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 17:00:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:00:05,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:05,253 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1] [2018-12-03 17:00:05,253 INFO L423 AbstractCegarLoop]: === Iteration 57 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:05,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2101809875, now seen corresponding path program 54 times [2018-12-03 17:00:05,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:05,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:05,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:05,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:05,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:06,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:06,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:06,006 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:06,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:06,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:06,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 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 17:00:06,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:06,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:06,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:06,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:06,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:06,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 190 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:06,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:06,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 17:00:06,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:06,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:00:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:00:06,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:00:06,369 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-03 17:00:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:06,430 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-03 17:00:06,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:00:06,431 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-03 17:00:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:06,431 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:00:06,431 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:00:06,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 63 SyntacticMatches, 38 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:00:06,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:00:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 17:00:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:00:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-03 17:00:06,436 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-12-03 17:00:06,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:06,436 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-03 17:00:06,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:00:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-03 17:00:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:00:06,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:06,437 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1] [2018-12-03 17:00:06,437 INFO L423 AbstractCegarLoop]: === Iteration 58 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:06,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:06,437 INFO L82 PathProgramCache]: Analyzing trace with hash -731658207, now seen corresponding path program 55 times [2018-12-03 17:00:06,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:06,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:06,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:06,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:06,904 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 17:00:06,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:06,905 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:06,905 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:06,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 17:00:06,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:06,905 INFO 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 17:00:06,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:06,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:06,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:06,947 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 17:00:06,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:06,954 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 17:00:06,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:06,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-03 17:00:06,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:06,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:00:06,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:00:06,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:00:06,975 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 22 states. [2018-12-03 17:00:07,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:07,506 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-03 17:00:07,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:00:07,506 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-12-03 17:00:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:07,507 INFO L225 Difference]: With dead ends: 68 [2018-12-03 17:00:07,507 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:00:07,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:00:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:00:07,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2018-12-03 17:00:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 17:00:07,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-12-03 17:00:07,512 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 43 [2018-12-03 17:00:07,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:07,513 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-12-03 17:00:07,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:00:07,513 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-12-03 17:00:07,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:00:07,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:07,514 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-12-03 17:00:07,514 INFO L423 AbstractCegarLoop]: === Iteration 59 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:07,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1206629459, now seen corresponding path program 56 times [2018-12-03 17:00:07,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:07,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:07,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:07,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:08,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:08,000 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:08,000 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:08,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:08,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:08,001 INFO 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 17:00:08,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:08,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:08,047 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 17:00:08,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:08,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:08,060 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:08,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:08,640 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:08,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:08,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-03 17:00:08,659 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:08,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:00:08,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:00:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:00:08,660 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 23 states. [2018-12-03 17:00:08,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:08,803 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-12-03 17:00:08,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:00:08,803 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-03 17:00:08,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:08,804 INFO L225 Difference]: With dead ends: 69 [2018-12-03 17:00:08,804 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:00:08,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 40 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:00:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:00:08,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 17:00:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:00:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 17:00:08,809 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 44 [2018-12-03 17:00:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:08,809 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 17:00:08,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:00:08,809 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 17:00:08,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:00:08,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:08,810 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1] [2018-12-03 17:00:08,810 INFO L423 AbstractCegarLoop]: === Iteration 60 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:08,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:08,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1092475975, now seen corresponding path program 57 times [2018-12-03 17:00:08,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:08,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:08,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:08,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:09,044 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:09,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:09,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:09,045 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:09,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:09,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:09,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:09,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:09,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:09,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:09,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:09,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:09,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 210 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:09,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:09,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-03 17:00:09,549 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:09,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:00:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:00:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:00:09,550 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-03 17:00:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:09,621 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-03 17:00:09,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:00:09,622 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-03 17:00:09,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:09,622 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:00:09,622 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 17:00:09,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 66 SyntacticMatches, 40 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:00:09,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 17:00:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 17:00:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 17:00:09,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-12-03 17:00:09,626 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 44 [2018-12-03 17:00:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:09,626 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-12-03 17:00:09,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:00:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-12-03 17:00:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 17:00:09,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:09,627 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1] [2018-12-03 17:00:09,627 INFO L423 AbstractCegarLoop]: === Iteration 61 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:09,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:09,627 INFO L82 PathProgramCache]: Analyzing trace with hash -493044665, now seen corresponding path program 58 times [2018-12-03 17:00:09,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:09,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:09,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:09,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:09,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:09,928 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 17:00:09,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:09,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:09,928 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:09,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:09,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:09,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:09,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:09,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:09,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:09,978 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 17:00:09,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:09,998 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 17:00:10,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:10,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 17:00:10,016 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:10,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:00:10,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:00:10,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:00:10,017 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 23 states. [2018-12-03 17:00:10,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:10,589 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-12-03 17:00:10,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:00:10,590 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-12-03 17:00:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:10,591 INFO L225 Difference]: With dead ends: 71 [2018-12-03 17:00:10,591 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 17:00:10,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:00:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 17:00:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2018-12-03 17:00:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:00:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-12-03 17:00:10,595 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2018-12-03 17:00:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:10,595 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-12-03 17:00:10,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:00:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-12-03 17:00:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:00:10,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:10,596 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-12-03 17:00:10,596 INFO L423 AbstractCegarLoop]: === Iteration 62 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:10,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:10,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1895423047, now seen corresponding path program 59 times [2018-12-03 17:00:10,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:10,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:10,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:10,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:10,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:11,003 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:11,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:11,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:11,003 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:11,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:11,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:11,004 INFO 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 17:00:11,012 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:11,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:11,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 17:00:11,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:11,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:11,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:11,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:11,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 17:00:11,436 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:11,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:00:11,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:00:11,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:00:11,437 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 24 states. [2018-12-03 17:00:11,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:11,549 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-03 17:00:11,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:00:11,549 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-03 17:00:11,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:11,550 INFO L225 Difference]: With dead ends: 72 [2018-12-03 17:00:11,550 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:00:11,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 42 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:00:11,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:00:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 17:00:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:00:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-03 17:00:11,555 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 46 [2018-12-03 17:00:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:11,555 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-03 17:00:11,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:00:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-03 17:00:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:00:11,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:11,556 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1] [2018-12-03 17:00:11,556 INFO L423 AbstractCegarLoop]: === Iteration 63 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:11,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash 153247469, now seen corresponding path program 60 times [2018-12-03 17:00:11,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:11,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:11,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:11,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:12,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:12,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:12,028 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:12,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:12,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:12,029 INFO 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 17:00:12,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:12,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:12,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:12,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:12,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:12,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:12,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:12,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 17:00:12,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:12,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:00:12,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:00:12,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:00:12,461 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-03 17:00:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:12,524 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-03 17:00:12,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:00:12,525 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-03 17:00:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:12,526 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:00:12,526 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 17:00:12,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 69 SyntacticMatches, 42 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:00:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 17:00:12,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 17:00:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:00:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-03 17:00:12,531 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-12-03 17:00:12,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:12,531 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-03 17:00:12,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:00:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-03 17:00:12,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 17:00:12,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:12,532 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1] [2018-12-03 17:00:12,532 INFO L423 AbstractCegarLoop]: === Iteration 64 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:12,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash 455642721, now seen corresponding path program 61 times [2018-12-03 17:00:12,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:12,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:12,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:12,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:12,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:12,920 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 17:00:12,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:12,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:12,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:12,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:12,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:12,921 INFO 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 17:00:12,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:12,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:12,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:12,968 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 17:00:12,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:12,976 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 17:00:12,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:12,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-03 17:00:12,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:12,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:00:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:00:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:00:12,996 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 24 states. [2018-12-03 17:00:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:13,728 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-12-03 17:00:13,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:00:13,728 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-12-03 17:00:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:13,729 INFO L225 Difference]: With dead ends: 74 [2018-12-03 17:00:13,729 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:00:13,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:00:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:00:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2018-12-03 17:00:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:00:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-12-03 17:00:13,735 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2018-12-03 17:00:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:13,735 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-12-03 17:00:13,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:00:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-12-03 17:00:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:00:13,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:13,736 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-12-03 17:00:13,736 INFO L423 AbstractCegarLoop]: === Iteration 65 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:13,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1239960941, now seen corresponding path program 62 times [2018-12-03 17:00:13,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:13,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:13,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:13,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:13,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:13,962 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:13,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:13,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:13,962 INFO 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 17:00:13,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:13,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:14,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 17:00:14,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:14,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:14,011 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:14,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:14,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:14,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-03 17:00:14,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:14,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:00:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:00:14,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:00:14,442 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 25 states. [2018-12-03 17:00:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:14,606 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2018-12-03 17:00:14,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:00:14,606 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-03 17:00:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:14,607 INFO L225 Difference]: With dead ends: 75 [2018-12-03 17:00:14,607 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:00:14,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 72 SyntacticMatches, 44 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:00:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:00:14,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 17:00:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:00:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 17:00:14,612 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 48 [2018-12-03 17:00:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:14,612 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 17:00:14,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:00:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 17:00:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:00:14,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:14,613 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1] [2018-12-03 17:00:14,613 INFO L423 AbstractCegarLoop]: === Iteration 66 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:14,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:14,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1227874425, now seen corresponding path program 63 times [2018-12-03 17:00:14,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:14,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:14,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:14,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:14,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:15,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:15,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:15,296 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:15,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:15,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:15,296 INFO 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 17:00:15,306 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:15,306 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:15,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:15,334 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:15,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:15,347 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:15,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:15,786 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 253 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:15,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:15,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-03 17:00:15,804 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:15,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:00:15,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:00:15,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:00:15,805 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-03 17:00:15,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:15,882 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-12-03 17:00:15,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:00:15,882 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-03 17:00:15,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:15,883 INFO L225 Difference]: With dead ends: 53 [2018-12-03 17:00:15,883 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 17:00:15,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 72 SyntacticMatches, 44 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:00:15,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 17:00:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 17:00:15,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:00:15,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-12-03 17:00:15,887 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 48 [2018-12-03 17:00:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:15,887 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-12-03 17:00:15,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:00:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-12-03 17:00:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:00:15,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:15,888 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1] [2018-12-03 17:00:15,888 INFO L423 AbstractCegarLoop]: === Iteration 67 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:15,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:15,888 INFO L82 PathProgramCache]: Analyzing trace with hash 590536967, now seen corresponding path program 64 times [2018-12-03 17:00:15,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:15,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:15,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:15,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:15,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:16,215 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 17:00:16,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:16,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:16,216 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:16,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:16,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:16,216 INFO 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 17:00:16,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:16,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:16,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:16,264 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 17:00:16,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:16,276 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 17:00:16,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:16,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 17:00:16,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:16,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:00:16,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:00:16,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:00:16,297 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 25 states. [2018-12-03 17:00:16,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:16,989 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 17:00:16,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:00:16,989 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-12-03 17:00:16,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:16,990 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:00:16,990 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 17:00:16,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:00:16,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 17:00:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2018-12-03 17:00:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:00:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-03 17:00:16,994 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2018-12-03 17:00:16,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:16,994 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-03 17:00:16,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:00:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-03 17:00:16,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:00:16,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:16,995 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-12-03 17:00:16,995 INFO L423 AbstractCegarLoop]: === Iteration 68 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:16,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:16,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1126715271, now seen corresponding path program 65 times [2018-12-03 17:00:16,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:16,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:16,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:16,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:16,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:17,256 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:17,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:17,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:17,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:17,256 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:17,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:17,256 INFO 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 17:00:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:17,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:17,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 17:00:17,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:17,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:17,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:17,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:17,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 17:00:17,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:17,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:00:17,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:00:17,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:00:17,710 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-12-03 17:00:17,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:17,872 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-12-03 17:00:17,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:00:17,873 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-03 17:00:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:17,874 INFO L225 Difference]: With dead ends: 78 [2018-12-03 17:00:17,874 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:00:17,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 75 SyntacticMatches, 46 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:00:17,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:00:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 17:00:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:00:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 17:00:17,878 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 50 [2018-12-03 17:00:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:17,879 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 17:00:17,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:00:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 17:00:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:00:17,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:17,879 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1] [2018-12-03 17:00:17,880 INFO L423 AbstractCegarLoop]: === Iteration 69 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:17,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1933230253, now seen corresponding path program 66 times [2018-12-03 17:00:17,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:17,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:17,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:17,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:17,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:18,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:18,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:18,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:18,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:18,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:18,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:18,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:18,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:18,398 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:18,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:18,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:18,408 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:18,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 276 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:18,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:18,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 17:00:18,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:18,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:00:18,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:00:18,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:00:18,938 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-03 17:00:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:19,105 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-03 17:00:19,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:00:19,106 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-03 17:00:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:19,107 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:00:19,107 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 17:00:19,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 75 SyntacticMatches, 46 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:00:19,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 17:00:19,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 17:00:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:00:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-03 17:00:19,112 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-03 17:00:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:19,112 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-03 17:00:19,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:00:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-03 17:00:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:00:19,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:19,112 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1] [2018-12-03 17:00:19,113 INFO L423 AbstractCegarLoop]: === Iteration 70 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:19,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash -199465823, now seen corresponding path program 67 times [2018-12-03 17:00:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:19,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:19,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:19,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:19,781 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 17:00:19,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:19,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:19,782 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:19,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:19,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:19,782 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:19,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:19,794 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:19,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:19,877 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 17:00:19,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:19,922 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 17:00:19,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:19,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-03 17:00:19,940 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:19,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:00:19,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:00:19,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:00:19,941 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 26 states. [2018-12-03 17:00:20,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:20,660 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-12-03 17:00:20,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:00:20,660 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-12-03 17:00:20,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:20,661 INFO L225 Difference]: With dead ends: 80 [2018-12-03 17:00:20,661 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:00:20,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:00:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:00:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2018-12-03 17:00:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:00:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-03 17:00:20,665 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2018-12-03 17:00:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:20,665 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-03 17:00:20,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:00:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-03 17:00:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:00:20,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:20,666 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-12-03 17:00:20,666 INFO L423 AbstractCegarLoop]: === Iteration 71 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:20,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:20,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1888534739, now seen corresponding path program 68 times [2018-12-03 17:00:20,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:20,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:20,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:20,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:20,667 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:20,931 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:20,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:20,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:20,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:20,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 17:00:20,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:20,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:20,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:20,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:20,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 17:00:20,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:20,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:20,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:21,436 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:21,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:21,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-03 17:00:21,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:21,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:00:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:00:21,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:00:21,458 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 27 states. [2018-12-03 17:00:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:21,654 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2018-12-03 17:00:21,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:00:21,654 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-03 17:00:21,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:21,655 INFO L225 Difference]: With dead ends: 81 [2018-12-03 17:00:21,655 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:00:21,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 78 SyntacticMatches, 48 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:00:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:00:21,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 17:00:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:00:21,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-03 17:00:21,660 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 52 [2018-12-03 17:00:21,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:21,660 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-03 17:00:21,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:00:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-03 17:00:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:00:21,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:21,660 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1] [2018-12-03 17:00:21,661 INFO L423 AbstractCegarLoop]: === Iteration 72 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:21,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:21,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1638593223, now seen corresponding path program 69 times [2018-12-03 17:00:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:21,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:21,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:21,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:22,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:22,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:22,018 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:22,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:22,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:22,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:22,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:22,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:22,059 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:22,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:22,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:22,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 300 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:22,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:22,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-03 17:00:22,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:22,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:00:22,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:00:22,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:00:22,561 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-03 17:00:22,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:22,632 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-12-03 17:00:22,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:00:22,634 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-03 17:00:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:22,635 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:00:22,635 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 17:00:22,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 78 SyntacticMatches, 48 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:00:22,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 17:00:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 17:00:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:00:22,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-12-03 17:00:22,638 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 52 [2018-12-03 17:00:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:22,638 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-12-03 17:00:22,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:00:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-12-03 17:00:22,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:00:22,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:22,639 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1] [2018-12-03 17:00:22,639 INFO L423 AbstractCegarLoop]: === Iteration 73 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:22,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:22,639 INFO L82 PathProgramCache]: Analyzing trace with hash -743279161, now seen corresponding path program 70 times [2018-12-03 17:00:22,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:22,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:22,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:22,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:22,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:23,112 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 17:00:23,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:23,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:23,113 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:23,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:23,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:23,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:23,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:23,121 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:23,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:23,172 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 17:00:23,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:23,189 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 17:00:23,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:23,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 17:00:23,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:23,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:00:23,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:00:23,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:00:23,218 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 27 states. [2018-12-03 17:00:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:24,127 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2018-12-03 17:00:24,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:00:24,127 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2018-12-03 17:00:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:24,128 INFO L225 Difference]: With dead ends: 83 [2018-12-03 17:00:24,128 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 17:00:24,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:00:24,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 17:00:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 56. [2018-12-03 17:00:24,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 17:00:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-03 17:00:24,132 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2018-12-03 17:00:24,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:24,132 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-03 17:00:24,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:00:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-03 17:00:24,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:00:24,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:24,133 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-12-03 17:00:24,133 INFO L423 AbstractCegarLoop]: === Iteration 74 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:24,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:24,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1566879033, now seen corresponding path program 71 times [2018-12-03 17:00:24,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:24,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:24,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:24,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:24,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:26,322 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:26,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:26,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:26,323 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:26,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:26,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:26,323 INFO 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 17:00:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:26,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:26,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:00:26,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:26,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:26,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:27,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:27,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 17:00:27,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:27,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:00:27,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:00:27,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:00:27,189 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 28 states. [2018-12-03 17:00:27,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:27,449 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-12-03 17:00:27,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:00:27,450 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-03 17:00:27,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:27,450 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:00:27,451 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 17:00:27,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 81 SyntacticMatches, 50 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:00:27,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 17:00:27,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 17:00:27,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 17:00:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-03 17:00:27,456 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 54 [2018-12-03 17:00:27,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:27,456 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-03 17:00:27,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:00:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-03 17:00:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:00:27,457 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:27,457 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1] [2018-12-03 17:00:27,457 INFO L423 AbstractCegarLoop]: === Iteration 75 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:27,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:27,457 INFO L82 PathProgramCache]: Analyzing trace with hash 399905389, now seen corresponding path program 72 times [2018-12-03 17:00:27,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:27,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:27,458 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:27,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:27,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:27,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:27,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:27,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:27,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 17:00:27,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:27,814 INFO 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 17:00:27,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:27,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:27,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:27,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:27,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:27,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:28,572 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 325 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:28,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:28,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 17:00:28,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:28,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:00:28,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:00:28,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:00:28,591 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-03 17:00:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:28,667 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-12-03 17:00:28,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:00:28,668 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-03 17:00:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:28,669 INFO L225 Difference]: With dead ends: 59 [2018-12-03 17:00:28,669 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 17:00:28,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 81 SyntacticMatches, 50 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:00:28,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 17:00:28,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 17:00:28,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 17:00:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-03 17:00:28,675 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2018-12-03 17:00:28,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:28,675 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-03 17:00:28,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:00:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-03 17:00:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 17:00:28,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:28,676 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1] [2018-12-03 17:00:28,676 INFO L423 AbstractCegarLoop]: === Iteration 76 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:28,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash -487896351, now seen corresponding path program 73 times [2018-12-03 17:00:28,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:28,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:28,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:29,170 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 17:00:29,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:29,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:29,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:29,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,170 INFO 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 17:00:29,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:29,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:29,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:29,244 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 17:00:29,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:29,260 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 17:00:29,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:29,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-03 17:00:29,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:29,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:00:29,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:00:29,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:00:29,289 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 28 states. [2018-12-03 17:00:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:31,210 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-12-03 17:00:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:00:31,210 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 55 [2018-12-03 17:00:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:31,212 INFO L225 Difference]: With dead ends: 86 [2018-12-03 17:00:31,212 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:00:31,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 130 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:00:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:00:31,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 58. [2018-12-03 17:00:31,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 17:00:31,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-12-03 17:00:31,217 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 55 [2018-12-03 17:00:31,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:31,218 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-12-03 17:00:31,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:00:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-12-03 17:00:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 17:00:31,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:31,218 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-12-03 17:00:31,218 INFO L423 AbstractCegarLoop]: === Iteration 77 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:31,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:31,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2055020781, now seen corresponding path program 74 times [2018-12-03 17:00:31,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:31,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:31,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:31,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:31,502 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:31,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:31,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:31,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:31,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:31,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:31,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:31,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:31,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:31,550 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:00:31,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:31,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:31,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:32,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:32,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-03 17:00:32,084 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:32,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:00:32,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:00:32,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:00:32,085 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 29 states. [2018-12-03 17:00:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:32,326 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2018-12-03 17:00:32,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:00:32,326 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-03 17:00:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:32,327 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:00:32,327 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:00:32,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 84 SyntacticMatches, 52 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:00:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:00:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 17:00:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 17:00:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 17:00:32,332 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 56 [2018-12-03 17:00:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:32,332 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 17:00:32,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:00:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 17:00:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 17:00:32,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:32,333 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1] [2018-12-03 17:00:32,333 INFO L423 AbstractCegarLoop]: === Iteration 78 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:32,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:32,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1399171577, now seen corresponding path program 75 times [2018-12-03 17:00:32,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:32,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:32,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:32,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:32,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:32,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:32,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:32,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:32,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:32,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:32,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:32,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:32,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:32,780 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:32,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:32,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:32,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 351 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:33,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:33,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-03 17:00:33,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:33,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:00:33,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:00:33,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:00:33,563 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-03 17:00:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:33,688 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-12-03 17:00:33,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:00:33,688 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-03 17:00:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:33,689 INFO L225 Difference]: With dead ends: 61 [2018-12-03 17:00:33,689 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 17:00:33,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 84 SyntacticMatches, 52 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:00:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 17:00:33,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 17:00:33,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 17:00:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-12-03 17:00:33,694 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 56 [2018-12-03 17:00:33,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:33,695 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-12-03 17:00:33,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:00:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-12-03 17:00:33,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 17:00:33,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:33,695 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1] [2018-12-03 17:00:33,696 INFO L423 AbstractCegarLoop]: === Iteration 79 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:33,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:33,696 INFO L82 PathProgramCache]: Analyzing trace with hash -424707449, now seen corresponding path program 76 times [2018-12-03 17:00:33,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:33,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:33,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:33,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:33,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:35,154 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 17:00:35,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:35,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:35,154 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:35,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:35,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:35,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:35,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:35,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:35,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:35,263 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 17:00:35,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:35,323 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 17:00:35,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:35,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 17:00:35,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:35,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:00:35,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:00:35,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:00:35,352 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 29 states. [2018-12-03 17:00:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:36,289 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-12-03 17:00:36,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:00:36,290 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 57 [2018-12-03 17:00:36,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:36,290 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:00:36,291 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 17:00:36,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:00:36,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 17:00:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 60. [2018-12-03 17:00:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 17:00:36,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-03 17:00:36,297 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 57 [2018-12-03 17:00:36,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:36,297 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-03 17:00:36,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:00:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-03 17:00:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:00:36,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:36,298 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-12-03 17:00:36,298 INFO L423 AbstractCegarLoop]: === Iteration 80 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:36,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash -281090553, now seen corresponding path program 77 times [2018-12-03 17:00:36,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:36,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:36,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:36,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:36,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:36,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:36,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:36,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:36,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:36,735 INFO 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 17:00:36,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:36,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:36,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 17:00:36,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:36,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:36,797 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:36,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:37,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:37,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 17:00:37,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:37,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:00:37,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:00:37,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:00:37,368 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 30 states. [2018-12-03 17:00:37,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:37,605 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-12-03 17:00:37,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:00:37,605 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-03 17:00:37,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:37,606 INFO L225 Difference]: With dead ends: 90 [2018-12-03 17:00:37,606 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:00:37,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 87 SyntacticMatches, 54 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:00:37,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:00:37,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 17:00:37,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:00:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-03 17:00:37,611 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 58 [2018-12-03 17:00:37,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:37,611 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-03 17:00:37,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:00:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-03 17:00:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:00:37,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:37,612 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1] [2018-12-03 17:00:37,612 INFO L423 AbstractCegarLoop]: === Iteration 81 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:37,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash 13128749, now seen corresponding path program 78 times [2018-12-03 17:00:37,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:37,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:37,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:37,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:37,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:37,979 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:37,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:37,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:37,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:37,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:37,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:37,979 INFO 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 17:00:37,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:37,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:38,018 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:38,019 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:38,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:38,030 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:38,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 378 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:38,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:38,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 17:00:38,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:38,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:00:38,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:00:38,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:00:38,867 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-03 17:00:38,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:38,947 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-03 17:00:38,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:00:38,947 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-03 17:00:38,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:38,948 INFO L225 Difference]: With dead ends: 63 [2018-12-03 17:00:38,948 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 17:00:38,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 87 SyntacticMatches, 54 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:00:38,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 17:00:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 17:00:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 17:00:38,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-03 17:00:38,954 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2018-12-03 17:00:38,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:38,955 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-03 17:00:38,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:00:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-03 17:00:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:00:38,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:38,955 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1] [2018-12-03 17:00:38,956 INFO L423 AbstractCegarLoop]: === Iteration 82 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:38,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:38,956 INFO L82 PathProgramCache]: Analyzing trace with hash 406929697, now seen corresponding path program 79 times [2018-12-03 17:00:38,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:38,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:38,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:38,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:40,338 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 17:00:40,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:40,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:40,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:40,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:40,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:40,338 INFO 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 17:00:40,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:40,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:40,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:40,408 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 17:00:40,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:40,424 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 17:00:40,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:40,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-03 17:00:40,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:40,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:00:40,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:00:40,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:00:40,444 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 30 states. [2018-12-03 17:00:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:41,518 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-03 17:00:41,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:00:41,519 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 59 [2018-12-03 17:00:41,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:41,520 INFO L225 Difference]: With dead ends: 92 [2018-12-03 17:00:41,520 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:00:41,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 140 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:00:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:00:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2018-12-03 17:00:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 17:00:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-03 17:00:41,525 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 59 [2018-12-03 17:00:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:41,526 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-03 17:00:41,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:00:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-03 17:00:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 17:00:41,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:41,526 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-12-03 17:00:41,527 INFO L423 AbstractCegarLoop]: === Iteration 83 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:41,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -270142803, now seen corresponding path program 80 times [2018-12-03 17:00:41,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:41,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:41,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:41,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:41,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:42,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:42,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:42,188 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:42,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:42,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:42,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:42,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:42,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:42,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 17:00:42,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:42,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:42,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:42,824 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:42,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:42,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-03 17:00:42,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:42,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:00:42,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:00:42,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:00:42,844 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 31 states. [2018-12-03 17:00:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:43,060 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2018-12-03 17:00:43,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:00:43,061 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-03 17:00:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:43,062 INFO L225 Difference]: With dead ends: 93 [2018-12-03 17:00:43,062 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:00:43,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 90 SyntacticMatches, 56 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:00:43,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:00:43,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 17:00:43,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 17:00:43,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 17:00:43,066 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 60 [2018-12-03 17:00:43,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:43,067 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 17:00:43,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:00:43,067 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 17:00:43,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 17:00:43,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:43,067 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1] [2018-12-03 17:00:43,067 INFO L423 AbstractCegarLoop]: === Iteration 84 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:43,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash 260720967, now seen corresponding path program 81 times [2018-12-03 17:00:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:43,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:43,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:43,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:43,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:43,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:43,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:43,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 17:00:43,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:43,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:43,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:43,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:43,470 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:43,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:43,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:43,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 406 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:44,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:44,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-03 17:00:44,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:44,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:00:44,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:00:44,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:00:44,364 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-03 17:00:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:44,473 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-12-03 17:00:44,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:00:44,473 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-03 17:00:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:44,474 INFO L225 Difference]: With dead ends: 65 [2018-12-03 17:00:44,474 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 17:00:44,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 90 SyntacticMatches, 56 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:00:44,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 17:00:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 17:00:44,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 17:00:44,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-12-03 17:00:44,480 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 60 [2018-12-03 17:00:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:44,480 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-12-03 17:00:44,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:00:44,480 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-12-03 17:00:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 17:00:44,481 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:44,481 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1] [2018-12-03 17:00:44,481 INFO L423 AbstractCegarLoop]: === Iteration 85 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:44,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:44,481 INFO L82 PathProgramCache]: Analyzing trace with hash -507646137, now seen corresponding path program 82 times [2018-12-03 17:00:44,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:44,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:44,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:44,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:44,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:45,022 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 17:00:45,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:45,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:45,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:45,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:45,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:45,023 INFO 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 17:00:45,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:45,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:45,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:45,131 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 17:00:45,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:45,181 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 17:00:45,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:45,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 17:00:45,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:45,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:00:45,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:00:45,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:00:45,217 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 31 states. [2018-12-03 17:00:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:46,983 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2018-12-03 17:00:46,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:00:46,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 61 [2018-12-03 17:00:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:46,984 INFO L225 Difference]: With dead ends: 95 [2018-12-03 17:00:46,984 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:00:46,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:00:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:00:46,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2018-12-03 17:00:46,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:00:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-12-03 17:00:46,989 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 61 [2018-12-03 17:00:46,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:46,989 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-12-03 17:00:46,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:00:46,990 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-12-03 17:00:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 17:00:46,990 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:46,990 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-12-03 17:00:46,991 INFO L423 AbstractCegarLoop]: === Iteration 86 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:46,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1442777415, now seen corresponding path program 83 times [2018-12-03 17:00:46,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:46,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:46,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:46,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:46,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:46,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:47,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:47,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:47,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:47,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:47,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:47,354 INFO 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 17:00:47,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:47,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:47,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:00:47,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:47,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:47,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:48,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:48,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 17:00:48,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:48,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:00:48,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:00:48,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:00:48,130 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 32 states. [2018-12-03 17:00:48,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:48,321 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-12-03 17:00:48,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:00:48,322 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-03 17:00:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:48,323 INFO L225 Difference]: With dead ends: 96 [2018-12-03 17:00:48,323 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 17:00:48,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 93 SyntacticMatches, 58 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1036 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:00:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 17:00:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 17:00:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:00:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-03 17:00:48,329 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 62 [2018-12-03 17:00:48,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:48,329 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-03 17:00:48,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:00:48,330 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-03 17:00:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 17:00:48,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:48,330 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1] [2018-12-03 17:00:48,330 INFO L423 AbstractCegarLoop]: === Iteration 87 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:48,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash 719685101, now seen corresponding path program 84 times [2018-12-03 17:00:48,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:48,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:48,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:48,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:48,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:49,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:49,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:49,646 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:49,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 17:00:49,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:49,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 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 17:00:49,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:49,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:49,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:49,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:49,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:49,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 435 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:50,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:50,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 17:00:50,346 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:50,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:00:50,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:00:50,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:00:50,347 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-03 17:00:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:50,437 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-03 17:00:50,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:00:50,437 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-03 17:00:50,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:50,438 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:00:50,438 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 17:00:50,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 93 SyntacticMatches, 58 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:00:50,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 17:00:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 17:00:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:00:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-03 17:00:50,444 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-03 17:00:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:50,444 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-03 17:00:50,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:00:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-03 17:00:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 17:00:50,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:50,445 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1] [2018-12-03 17:00:50,445 INFO L423 AbstractCegarLoop]: === Iteration 88 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:50,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:50,445 INFO L82 PathProgramCache]: Analyzing trace with hash 835340129, now seen corresponding path program 85 times [2018-12-03 17:00:50,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:50,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:50,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:50,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:50,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:50,979 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 17:00:50,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:50,979 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:50,979 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:50,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:50,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:50,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:50,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:50,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:51,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:51,080 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 17:00:51,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:51,091 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 17:00:51,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:51,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-03 17:00:51,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:51,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:00:51,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:00:51,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:00:51,112 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 32 states. [2018-12-03 17:00:52,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:52,241 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-12-03 17:00:52,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:00:52,242 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 63 [2018-12-03 17:00:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:52,243 INFO L225 Difference]: With dead ends: 98 [2018-12-03 17:00:52,243 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:00:52,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 150 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:00:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:00:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 66. [2018-12-03 17:00:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 17:00:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 17:00:52,249 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 63 [2018-12-03 17:00:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:52,249 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 17:00:52,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:00:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 17:00:52,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 17:00:52,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:52,250 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-12-03 17:00:52,250 INFO L423 AbstractCegarLoop]: === Iteration 89 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:52,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash 125678701, now seen corresponding path program 86 times [2018-12-03 17:00:52,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:52,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:52,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:52,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:52,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:52,853 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:52,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:52,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:52,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:52,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:52,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:52,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:00:52,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:52,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:52,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:53,750 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:53,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:53,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-03 17:00:53,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:53,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:00:53,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:00:53,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:00:53,770 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 33 states. [2018-12-03 17:00:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:54,247 INFO L93 Difference]: Finished difference Result 99 states and 101 transitions. [2018-12-03 17:00:54,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:00:54,247 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-03 17:00:54,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:54,248 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:00:54,248 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:00:54,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 96 SyntacticMatches, 60 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:00:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:00:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 17:00:54,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:00:54,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-03 17:00:54,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 64 [2018-12-03 17:00:54,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:54,253 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-03 17:00:54,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:00:54,253 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-03 17:00:54,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 17:00:54,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:54,254 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1] [2018-12-03 17:00:54,254 INFO L423 AbstractCegarLoop]: === Iteration 90 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:54,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:54,254 INFO L82 PathProgramCache]: Analyzing trace with hash -815346553, now seen corresponding path program 87 times [2018-12-03 17:00:54,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:54,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:54,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:54,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:54,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:54,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:54,676 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:54,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:54,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:54,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:54,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:54,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:54,721 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:54,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:54,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:54,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 465 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:55,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:55,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-03 17:00:55,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:55,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:00:55,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:00:55,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:00:55,447 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-03 17:00:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:55,535 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-12-03 17:00:55,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:00:55,536 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-03 17:00:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:55,536 INFO L225 Difference]: With dead ends: 69 [2018-12-03 17:00:55,536 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 17:00:55,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 96 SyntacticMatches, 60 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:00:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 17:00:55,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 17:00:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 17:00:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-12-03 17:00:55,542 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 64 [2018-12-03 17:00:55,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:55,543 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-12-03 17:00:55,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:00:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-12-03 17:00:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 17:00:55,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:55,543 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1] [2018-12-03 17:00:55,544 INFO L423 AbstractCegarLoop]: === Iteration 91 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:55,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:55,544 INFO L82 PathProgramCache]: Analyzing trace with hash 493999111, now seen corresponding path program 88 times [2018-12-03 17:00:55,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:55,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:55,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:55,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:55,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:56,129 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 17:00:56,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:56,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:56,129 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:56,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 17:00:56,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:56,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 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 17:00:56,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:56,138 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:56,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:56,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:56,208 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 17:00:56,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:56,224 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 17:00:56,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:56,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 17:00:56,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:56,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:00:56,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:00:56,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:00:56,247 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 33 states. [2018-12-03 17:00:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:57,462 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-12-03 17:00:57,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:00:57,463 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 65 [2018-12-03 17:00:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:57,463 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:00:57,465 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:00:57,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 155 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:00:57,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:00:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 68. [2018-12-03 17:00:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 17:00:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-03 17:00:57,470 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 65 [2018-12-03 17:00:57,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:57,470 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-03 17:00:57,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:00:57,470 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-03 17:00:57,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:00:57,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:57,470 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-12-03 17:00:57,470 INFO L423 AbstractCegarLoop]: === Iteration 92 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:57,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:57,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1865958265, now seen corresponding path program 89 times [2018-12-03 17:00:57,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:57,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:57,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:57,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:57,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:57,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:57,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:57,865 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:57,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:57,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:57,866 INFO 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 17:00:57,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:57,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:57,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 17:00:57,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:57,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:57,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:58,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:58,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 17:00:58,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:58,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:00:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:00:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:00:58,765 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 34 states. [2018-12-03 17:00:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:59,324 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-03 17:00:59,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:00:59,325 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-03 17:00:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:59,326 INFO L225 Difference]: With dead ends: 102 [2018-12-03 17:00:59,326 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 17:00:59,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 99 SyntacticMatches, 62 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:00:59,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 17:00:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 17:00:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:00:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 17:00:59,332 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 66 [2018-12-03 17:00:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:59,332 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 17:00:59,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:00:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 17:00:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:00:59,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:59,333 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1] [2018-12-03 17:00:59,333 INFO L423 AbstractCegarLoop]: === Iteration 93 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:59,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash -972970067, now seen corresponding path program 90 times [2018-12-03 17:00:59,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:59,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:59,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:59,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:59,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:59,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:59,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:59,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:59,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:59,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:59,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:00:59,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:59,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:59,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:59,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:59,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:59,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 496 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:00,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:00,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 17:01:00,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:00,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:01:00,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:01:00,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:01:00,585 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-03 17:01:00,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:00,676 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-12-03 17:01:00,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:01:00,677 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-03 17:01:00,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:00,678 INFO L225 Difference]: With dead ends: 71 [2018-12-03 17:01:00,678 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 17:01:00,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 99 SyntacticMatches, 62 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:01:00,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 17:01:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 17:01:00,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 17:01:00,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-12-03 17:01:00,682 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2018-12-03 17:01:00,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:00,683 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-12-03 17:01:00,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:01:00,683 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-12-03 17:01:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:01:00,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:00,683 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1] [2018-12-03 17:01:00,683 INFO L423 AbstractCegarLoop]: === Iteration 94 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:00,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash -97362527, now seen corresponding path program 91 times [2018-12-03 17:01:00,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:00,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:00,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:00,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:00,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:01,303 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 17:01:01,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:01,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:01,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:01,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:01,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:01,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:01:01,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:01,324 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:01,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:01,431 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 17:01:01,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:01,494 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 17:01:01,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:01,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-03 17:01:01,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:01,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:01:01,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:01:01,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:01:01,524 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 34 states. [2018-12-03 17:01:02,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:02,911 INFO L93 Difference]: Finished difference Result 104 states and 106 transitions. [2018-12-03 17:01:02,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:01:02,912 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 67 [2018-12-03 17:01:02,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:02,913 INFO L225 Difference]: With dead ends: 104 [2018-12-03 17:01:02,913 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:01:02,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 160 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:01:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:01:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 70. [2018-12-03 17:01:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 17:01:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-03 17:01:02,918 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 67 [2018-12-03 17:01:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:02,918 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-03 17:01:02,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:01:02,918 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-03 17:01:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:01:02,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:02,918 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-12-03 17:01:02,919 INFO L423 AbstractCegarLoop]: === Iteration 95 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:02,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:02,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1276667437, now seen corresponding path program 92 times [2018-12-03 17:01:02,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:02,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:02,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:02,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:02,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:03,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:03,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:03,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:03,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:03,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:03,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:03,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:01:03,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:03,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:03,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 17:01:03,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:03,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:03,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:03,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:05,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:05,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:05,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-03 17:01:05,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:05,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:01:05,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:01:05,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:01:05,035 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 35 states. [2018-12-03 17:01:05,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:05,365 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2018-12-03 17:01:05,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:01:05,366 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-03 17:01:05,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:05,367 INFO L225 Difference]: With dead ends: 105 [2018-12-03 17:01:05,367 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:01:05,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 102 SyntacticMatches, 64 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:01:05,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:01:05,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 17:01:05,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:01:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 17:01:05,373 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 68 [2018-12-03 17:01:05,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:05,373 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 17:01:05,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:01:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 17:01:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:01:05,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:05,374 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1] [2018-12-03 17:01:05,374 INFO L423 AbstractCegarLoop]: === Iteration 96 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:05,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:05,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1105469497, now seen corresponding path program 93 times [2018-12-03 17:01:05,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:05,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:05,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:05,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:05,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:05,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:05,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:05,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:05,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:05,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:05,979 INFO 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 17:01:05,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:05,988 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:06,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:06,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:06,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:06,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:06,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 528 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:06,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:06,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-03 17:01:06,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:06,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:01:06,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:01:06,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:01:06,907 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-03 17:01:07,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:07,010 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-12-03 17:01:07,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:01:07,011 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-03 17:01:07,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:07,011 INFO L225 Difference]: With dead ends: 73 [2018-12-03 17:01:07,012 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 17:01:07,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 102 SyntacticMatches, 64 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:01:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 17:01:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 17:01:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 17:01:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-12-03 17:01:07,017 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 68 [2018-12-03 17:01:07,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:07,017 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-12-03 17:01:07,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:01:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-12-03 17:01:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 17:01:07,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:07,018 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1] [2018-12-03 17:01:07,018 INFO L423 AbstractCegarLoop]: === Iteration 97 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:07,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:07,018 INFO L82 PathProgramCache]: Analyzing trace with hash 90122439, now seen corresponding path program 94 times [2018-12-03 17:01:07,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:07,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:07,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:07,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:07,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:07,626 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 17:01:07,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:07,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:07,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:07,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 17:01:07,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:07,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 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 17:01:07,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:07,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:07,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:07,693 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 17:01:07,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:07,713 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 17:01:07,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:07,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 17:01:07,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:07,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:01:07,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:01:07,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:01:07,732 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 35 states. [2018-12-03 17:01:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:09,119 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2018-12-03 17:01:09,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:01:09,120 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 69 [2018-12-03 17:01:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:09,120 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:01:09,120 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 17:01:09,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 165 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:01:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 17:01:09,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2018-12-03 17:01:09,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 17:01:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-12-03 17:01:09,124 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 69 [2018-12-03 17:01:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:09,124 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-12-03 17:01:09,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:01:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-12-03 17:01:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 17:01:09,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:09,125 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-12-03 17:01:09,125 INFO L423 AbstractCegarLoop]: === Iteration 98 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:09,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:09,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1501233209, now seen corresponding path program 95 times [2018-12-03 17:01:09,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:09,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:09,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:09,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:09,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:09,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:09,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:09,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:09,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:09,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:09,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:01:09,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:09,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:09,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 17:01:09,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:09,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:09,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:10,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:10,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 17:01:10,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:10,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:01:10,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:01:10,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:01:10,704 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 36 states. [2018-12-03 17:01:11,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:11,049 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-12-03 17:01:11,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:01:11,050 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-03 17:01:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:11,051 INFO L225 Difference]: With dead ends: 108 [2018-12-03 17:01:11,051 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:01:11,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 105 SyntacticMatches, 66 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1312 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:01:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:01:11,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 17:01:11,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 17:01:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-03 17:01:11,057 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 70 [2018-12-03 17:01:11,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:11,058 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-03 17:01:11,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:01:11,058 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-03 17:01:11,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 17:01:11,058 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:11,058 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1] [2018-12-03 17:01:11,059 INFO L423 AbstractCegarLoop]: === Iteration 99 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:11,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:11,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1961933165, now seen corresponding path program 96 times [2018-12-03 17:01:11,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:11,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:11,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:11,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:11,060 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:11,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:11,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:11,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:11,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:11,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:11,527 INFO 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 17:01:11,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:11,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:11,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:11,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:11,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:11,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:12,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 561 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:12,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:12,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 17:01:12,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:12,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:01:12,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:01:12,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:01:12,431 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-03 17:01:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:12,533 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-03 17:01:12,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:01:12,533 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-03 17:01:12,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:12,534 INFO L225 Difference]: With dead ends: 75 [2018-12-03 17:01:12,534 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 17:01:12,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 105 SyntacticMatches, 66 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:01:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 17:01:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 17:01:12,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 17:01:12,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-03 17:01:12,539 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2018-12-03 17:01:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:12,539 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-03 17:01:12,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:01:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-03 17:01:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 17:01:12,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:12,539 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1] [2018-12-03 17:01:12,540 INFO L423 AbstractCegarLoop]: === Iteration 100 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:12,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:12,540 INFO L82 PathProgramCache]: Analyzing trace with hash 690324449, now seen corresponding path program 97 times [2018-12-03 17:01:12,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:12,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:12,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:12,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:13,189 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 17:01:13,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:13,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:13,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:13,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:13,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:13,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:13,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:13,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:13,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:13,261 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 17:01:13,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:13,279 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 17:01:13,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:13,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-03 17:01:13,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:13,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:01:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:01:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:01:13,298 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 36 states. [2018-12-03 17:01:14,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:14,937 INFO L93 Difference]: Finished difference Result 110 states and 112 transitions. [2018-12-03 17:01:14,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:01:14,938 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 71 [2018-12-03 17:01:14,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:14,939 INFO L225 Difference]: With dead ends: 110 [2018-12-03 17:01:14,939 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:01:14,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:01:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:01:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2018-12-03 17:01:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 17:01:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-12-03 17:01:14,944 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 71 [2018-12-03 17:01:14,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:14,944 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-12-03 17:01:14,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:01:14,944 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-03 17:01:14,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 17:01:14,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:14,945 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-12-03 17:01:14,945 INFO L423 AbstractCegarLoop]: === Iteration 101 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:14,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash -74840083, now seen corresponding path program 98 times [2018-12-03 17:01:14,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:14,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:14,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:14,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:14,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:15,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:15,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:15,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:15,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:15,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:15,507 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:15,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:15,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:15,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 17:01:15,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:15,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:15,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:16,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:16,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-03 17:01:16,408 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:16,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:01:16,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:01:16,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:01:16,409 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 37 states. [2018-12-03 17:01:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:16,775 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2018-12-03 17:01:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:01:16,776 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-03 17:01:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:16,777 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:01:16,777 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 17:01:16,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 108 SyntacticMatches, 68 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:01:16,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 17:01:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 17:01:16,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:01:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 17:01:16,782 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 72 [2018-12-03 17:01:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:16,782 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 17:01:16,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:01:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 17:01:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 17:01:16,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:16,783 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1] [2018-12-03 17:01:16,783 INFO L423 AbstractCegarLoop]: === Iteration 102 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:16,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:16,783 INFO L82 PathProgramCache]: Analyzing trace with hash -90864889, now seen corresponding path program 99 times [2018-12-03 17:01:16,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:16,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:16,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:16,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:16,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:17,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:17,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:17,307 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:17,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:17,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:17,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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:17,317 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:17,317 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:17,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:17,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:17,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:17,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 595 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:18,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:18,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-03 17:01:18,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:18,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:01:18,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:01:18,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:01:18,285 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-03 17:01:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:18,404 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-12-03 17:01:18,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:01:18,405 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-03 17:01:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:18,406 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:01:18,406 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 17:01:18,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 108 SyntacticMatches, 68 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:01:18,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 17:01:18,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 17:01:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 17:01:18,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-12-03 17:01:18,412 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 72 [2018-12-03 17:01:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:18,413 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-12-03 17:01:18,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:01:18,413 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-12-03 17:01:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 17:01:18,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:18,413 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1] [2018-12-03 17:01:18,413 INFO L423 AbstractCegarLoop]: === Iteration 103 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:18,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1478094215, now seen corresponding path program 100 times [2018-12-03 17:01:18,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:18,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:18,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:18,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:18,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:19,124 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 17:01:19,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:19,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:19,125 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:19,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:19,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:19,125 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:19,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:19,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:19,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:19,195 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 17:01:19,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:19,214 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 17:01:19,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:19,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 17:01:19,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:19,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:01:19,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:01:19,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:01:19,233 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 37 states. [2018-12-03 17:01:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:20,896 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-12-03 17:01:20,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:01:20,897 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2018-12-03 17:01:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:20,898 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:01:20,898 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 17:01:20,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 175 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:01:20,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 17:01:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2018-12-03 17:01:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 17:01:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-12-03 17:01:20,904 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 73 [2018-12-03 17:01:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:20,904 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-12-03 17:01:20,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:01:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-12-03 17:01:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 17:01:20,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:20,905 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-12-03 17:01:20,905 INFO L423 AbstractCegarLoop]: === Iteration 104 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:20,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1423781113, now seen corresponding path program 101 times [2018-12-03 17:01:20,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:20,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:20,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:20,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:21,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:21,480 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:21,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:21,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:21,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:21,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:21,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 17:01:21,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:21,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:22,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:22,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 17:01:22,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:22,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:01:22,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:01:22,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:01:22,485 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 38 states. [2018-12-03 17:01:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:22,744 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-12-03 17:01:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:01:22,745 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-03 17:01:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:22,746 INFO L225 Difference]: With dead ends: 114 [2018-12-03 17:01:22,746 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:01:22,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 111 SyntacticMatches, 70 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1462 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:01:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:01:22,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 17:01:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:01:22,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 17:01:22,753 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 74 [2018-12-03 17:01:22,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:22,753 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 17:01:22,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:01:22,753 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 17:01:22,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 17:01:22,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:22,754 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1] [2018-12-03 17:01:22,754 INFO L423 AbstractCegarLoop]: === Iteration 105 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:22,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:22,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1920550099, now seen corresponding path program 102 times [2018-12-03 17:01:22,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:22,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:22,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:22,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:22,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:23,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:23,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:23,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:23,414 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:23,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:23,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:23,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:23,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:23,423 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:23,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:23,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:23,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:23,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 630 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:24,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:24,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 17:01:24,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:24,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:01:24,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:01:24,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:01:24,413 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-03 17:01:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:24,560 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-12-03 17:01:24,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:01:24,560 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-03 17:01:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:24,561 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:01:24,561 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 17:01:24,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 111 SyntacticMatches, 70 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:01:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 17:01:24,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 17:01:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 17:01:24,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-03 17:01:24,567 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-03 17:01:24,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:24,567 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-03 17:01:24,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:01:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-03 17:01:24,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 17:01:24,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:24,568 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1] [2018-12-03 17:01:24,568 INFO L423 AbstractCegarLoop]: === Iteration 106 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:24,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:24,568 INFO L82 PathProgramCache]: Analyzing trace with hash 592427553, now seen corresponding path program 103 times [2018-12-03 17:01:24,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:24,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:24,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:24,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:24,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:24,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:25,566 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 17:01:25,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:25,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:25,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:25,567 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:25,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:25,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:25,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:25,575 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:25,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:25,639 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 17:01:25,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:25,656 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 17:01:25,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:25,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-03 17:01:25,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:25,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:01:25,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:01:25,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:01:25,676 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 38 states. [2018-12-03 17:01:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:27,344 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-12-03 17:01:27,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:01:27,344 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 75 [2018-12-03 17:01:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:27,346 INFO L225 Difference]: With dead ends: 116 [2018-12-03 17:01:27,346 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:01:27,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 180 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:01:27,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:01:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 78. [2018-12-03 17:01:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 17:01:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-12-03 17:01:27,352 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2018-12-03 17:01:27,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:27,353 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-12-03 17:01:27,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:01:27,353 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-12-03 17:01:27,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 17:01:27,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:27,353 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-12-03 17:01:27,353 INFO L423 AbstractCegarLoop]: === Iteration 107 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:27,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1185323437, now seen corresponding path program 104 times [2018-12-03 17:01:27,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:27,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:27,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:27,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:27,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:27,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:27,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:27,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:27,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:27,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:27,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:27,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:27,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:28,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 17:01:28,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:28,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:28,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:29,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:29,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-03 17:01:29,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:29,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:01:29,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:01:29,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:01:29,071 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 39 states. [2018-12-03 17:01:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:29,379 INFO L93 Difference]: Finished difference Result 117 states and 119 transitions. [2018-12-03 17:01:29,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:01:29,387 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-03 17:01:29,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:29,387 INFO L225 Difference]: With dead ends: 117 [2018-12-03 17:01:29,387 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:01:29,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 114 SyntacticMatches, 72 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:01:29,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:01:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 17:01:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 17:01:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-03 17:01:29,392 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 76 [2018-12-03 17:01:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:29,392 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-03 17:01:29,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:01:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-03 17:01:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 17:01:29,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:29,393 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1] [2018-12-03 17:01:29,393 INFO L423 AbstractCegarLoop]: === Iteration 108 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:29,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:29,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1329613241, now seen corresponding path program 105 times [2018-12-03 17:01:29,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:29,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:29,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:29,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:29,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:30,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:30,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:30,326 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:30,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:30,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:30,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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:30,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:30,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:30,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:30,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:30,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:30,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 666 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:31,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:31,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-03 17:01:31,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:31,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:01:31,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:01:31,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:01:31,378 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-03 17:01:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:31,499 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-12-03 17:01:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:01:31,499 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-03 17:01:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:31,500 INFO L225 Difference]: With dead ends: 81 [2018-12-03 17:01:31,500 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 17:01:31,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 114 SyntacticMatches, 72 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:01:31,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 17:01:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 17:01:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 17:01:31,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-12-03 17:01:31,506 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 76 [2018-12-03 17:01:31,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:31,506 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-12-03 17:01:31,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:01:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-12-03 17:01:31,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 17:01:31,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:31,507 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1] [2018-12-03 17:01:31,507 INFO L423 AbstractCegarLoop]: === Iteration 109 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:31,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:31,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1731600967, now seen corresponding path program 106 times [2018-12-03 17:01:31,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:31,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:31,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:31,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:31,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:32,666 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 17:01:32,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:32,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:32,667 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:32,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:32,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:32,667 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:32,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:32,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:32,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:32,745 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 17:01:32,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:32,760 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 17:01:32,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:32,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 17:01:32,778 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:32,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:01:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:01:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:01:32,779 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 39 states. [2018-12-03 17:01:34,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:34,518 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2018-12-03 17:01:34,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:01:34,519 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 77 [2018-12-03 17:01:34,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:34,519 INFO L225 Difference]: With dead ends: 119 [2018-12-03 17:01:34,519 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 17:01:34,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:01:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 17:01:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 80. [2018-12-03 17:01:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:01:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-03 17:01:34,526 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2018-12-03 17:01:34,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:34,526 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-03 17:01:34,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:01:34,526 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-03 17:01:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 17:01:34,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:34,526 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-12-03 17:01:34,526 INFO L423 AbstractCegarLoop]: === Iteration 110 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:34,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2139960903, now seen corresponding path program 107 times [2018-12-03 17:01:34,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:34,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:34,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:35,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:35,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:35,409 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:35,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:35,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:35,410 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:35,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:35,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:35,475 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:01:35,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:35,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:35,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:36,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:36,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 17:01:36,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:36,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:01:36,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:01:36,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:01:36,634 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 40 states. [2018-12-03 17:01:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:37,065 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-12-03 17:01:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:01:37,065 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-03 17:01:37,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:37,066 INFO L225 Difference]: With dead ends: 120 [2018-12-03 17:01:37,066 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 17:01:37,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 117 SyntacticMatches, 74 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:01:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 17:01:37,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 17:01:37,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 17:01:37,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-03 17:01:37,074 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 78 [2018-12-03 17:01:37,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:37,074 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-03 17:01:37,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:01:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-03 17:01:37,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 17:01:37,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:37,075 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1] [2018-12-03 17:01:37,075 INFO L423 AbstractCegarLoop]: === Iteration 111 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:37,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:37,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1486335213, now seen corresponding path program 108 times [2018-12-03 17:01:37,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:37,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:37,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:37,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:37,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:37,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:37,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:37,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:37,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:37,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:37,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:37,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:37,669 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:37,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:37,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:37,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:37,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:38,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 703 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:38,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:38,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 17:01:38,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:38,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:01:38,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:01:38,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:01:38,804 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-03 17:01:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:38,916 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-12-03 17:01:38,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:01:38,916 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-03 17:01:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:38,917 INFO L225 Difference]: With dead ends: 83 [2018-12-03 17:01:38,917 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 17:01:38,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 117 SyntacticMatches, 74 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:01:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 17:01:38,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 17:01:38,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:01:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-12-03 17:01:38,924 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2018-12-03 17:01:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:38,924 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-12-03 17:01:38,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:01:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-12-03 17:01:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 17:01:38,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:38,924 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1] [2018-12-03 17:01:38,924 INFO L423 AbstractCegarLoop]: === Iteration 112 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:38,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1168310175, now seen corresponding path program 109 times [2018-12-03 17:01:38,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:38,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:38,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:38,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:38,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:39,753 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 17:01:39,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:39,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:39,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:39,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:39,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:39,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:39,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:39,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:39,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:39,831 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 17:01:39,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:39,852 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 17:01:39,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:39,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-03 17:01:39,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:39,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:01:39,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:01:39,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:01:39,871 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 40 states. [2018-12-03 17:01:41,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:41,831 INFO L93 Difference]: Finished difference Result 122 states and 124 transitions. [2018-12-03 17:01:41,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:01:41,831 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 79 [2018-12-03 17:01:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:41,832 INFO L225 Difference]: With dead ends: 122 [2018-12-03 17:01:41,832 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 17:01:41,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 190 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:01:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 17:01:41,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 82. [2018-12-03 17:01:41,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:01:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2018-12-03 17:01:41,839 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2018-12-03 17:01:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:41,839 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2018-12-03 17:01:41,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:01:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2018-12-03 17:01:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:01:41,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:41,840 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-12-03 17:01:41,840 INFO L423 AbstractCegarLoop]: === Iteration 113 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:41,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:41,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1857938579, now seen corresponding path program 110 times [2018-12-03 17:01:41,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:41,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:41,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:41,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:41,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:42,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:42,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:42,406 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:42,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:42,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:42,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:42,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:42,414 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:42,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:01:42,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:42,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:42,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:43,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:43,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-03 17:01:43,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:43,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:01:43,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:01:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:01:43,536 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 41 states. [2018-12-03 17:01:43,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:43,991 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2018-12-03 17:01:43,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:01:43,991 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-03 17:01:43,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:43,992 INFO L225 Difference]: With dead ends: 123 [2018-12-03 17:01:43,992 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:01:43,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 120 SyntacticMatches, 76 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1702 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:01:43,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:01:43,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 17:01:43,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 17:01:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 17:01:43,996 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 80 [2018-12-03 17:01:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:43,996 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 17:01:43,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:01:43,996 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 17:01:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:01:43,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:43,997 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1] [2018-12-03 17:01:43,997 INFO L423 AbstractCegarLoop]: === Iteration 114 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:43,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:43,997 INFO L82 PathProgramCache]: Analyzing trace with hash -645498489, now seen corresponding path program 111 times [2018-12-03 17:01:43,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:43,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:43,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:43,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:43,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:44,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:44,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:44,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:44,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 17:01:44,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:44,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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:44,596 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:44,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:44,641 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:44,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:44,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:44,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:44,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:45,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:46,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:46,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-03 17:01:46,004 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:46,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:01:46,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:01:46,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:01:46,004 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-03 17:01:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:46,137 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-12-03 17:01:46,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:01:46,137 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-03 17:01:46,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:46,138 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:01:46,138 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:01:46,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 120 SyntacticMatches, 76 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:01:46,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:01:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 17:01:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:01:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-12-03 17:01:46,143 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 80 [2018-12-03 17:01:46,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:46,143 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-12-03 17:01:46,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:01:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-12-03 17:01:46,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:01:46,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:46,144 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1] [2018-12-03 17:01:46,144 INFO L423 AbstractCegarLoop]: === Iteration 115 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:46,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1464321799, now seen corresponding path program 112 times [2018-12-03 17:01:46,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:46,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:46,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:46,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:46,146 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:47,000 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 17:01:47,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:47,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:47,001 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:47,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:47,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:47,001 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:47,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:47,010 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:47,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:47,082 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 17:01:47,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:47,103 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 17:01:47,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:47,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 17:01:47,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:47,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:01:47,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:01:47,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:01:47,122 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 41 states. [2018-12-03 17:01:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:49,008 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-12-03 17:01:49,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:01:49,009 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 81 [2018-12-03 17:01:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:49,009 INFO L225 Difference]: With dead ends: 125 [2018-12-03 17:01:49,009 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 17:01:49,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 195 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:01:49,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 17:01:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 84. [2018-12-03 17:01:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:01:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-12-03 17:01:49,016 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2018-12-03 17:01:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:49,016 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-12-03 17:01:49,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:01:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-12-03 17:01:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 17:01:49,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:49,017 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-12-03 17:01:49,017 INFO L423 AbstractCegarLoop]: === Iteration 116 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:49,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:49,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1850726009, now seen corresponding path program 113 times [2018-12-03 17:01:49,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:49,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:49,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:49,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:49,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:49,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:49,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:49,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:49,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:49,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:49,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:49,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:49,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:49,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 17:01:49,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:49,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:49,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:51,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:51,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 17:01:51,123 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:51,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:01:51,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:01:51,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:01:51,124 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 42 states. [2018-12-03 17:01:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:51,615 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-12-03 17:01:51,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:01:51,615 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-03 17:01:51,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:51,616 INFO L225 Difference]: With dead ends: 126 [2018-12-03 17:01:51,616 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:01:51,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 123 SyntacticMatches, 78 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1786 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:01:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:01:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 17:01:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 17:01:51,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-03 17:01:51,624 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 82 [2018-12-03 17:01:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:51,624 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-03 17:01:51,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:01:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-03 17:01:51,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 17:01:51,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:51,625 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1, 1, 1] [2018-12-03 17:01:51,625 INFO L423 AbstractCegarLoop]: === Iteration 117 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:51,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:51,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1375178413, now seen corresponding path program 114 times [2018-12-03 17:01:51,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:51,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:51,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:51,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:51,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:52,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:52,281 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:52,281 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:52,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:52,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:52,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:52,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:52,291 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:52,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:52,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:52,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:52,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:53,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:53,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 17:01:53,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:53,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:01:53,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:01:53,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:01:53,528 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-03 17:01:53,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:53,651 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-03 17:01:53,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:01:53,651 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-03 17:01:53,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:53,652 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:01:53,652 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 17:01:53,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 123 SyntacticMatches, 78 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:01:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 17:01:53,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 17:01:53,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:01:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-03 17:01:53,659 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2018-12-03 17:01:53,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:53,659 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-03 17:01:53,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:01:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-03 17:01:53,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 17:01:53,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:53,660 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1] [2018-12-03 17:01:53,660 INFO L423 AbstractCegarLoop]: === Iteration 118 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:53,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:53,660 INFO L82 PathProgramCache]: Analyzing trace with hash -319203679, now seen corresponding path program 115 times [2018-12-03 17:01:53,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:53,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:53,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:53,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:53,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:54,590 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 17:01:54,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:54,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:54,590 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:54,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:54,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:54,591 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:54,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:54,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:54,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:54,674 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 17:01:54,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:54,696 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 17:01:54,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:54,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-03 17:01:54,714 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:54,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:01:54,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:01:54,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:01:54,715 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 42 states. [2018-12-03 17:01:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:56,896 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-12-03 17:01:56,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:01:56,897 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 83 [2018-12-03 17:01:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:56,897 INFO L225 Difference]: With dead ends: 128 [2018-12-03 17:01:56,898 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 17:01:56,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:01:56,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 17:01:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2018-12-03 17:01:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 17:01:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-12-03 17:01:56,903 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2018-12-03 17:01:56,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:56,904 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-12-03 17:01:56,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:01:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-12-03 17:01:56,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:01:56,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:56,904 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-12-03 17:01:56,904 INFO L423 AbstractCegarLoop]: === Iteration 119 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:56,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:56,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1305440979, now seen corresponding path program 116 times [2018-12-03 17:01:56,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:56,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:56,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:56,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:57,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:57,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:57,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:57,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 17:01:57,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:57,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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:57,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:57,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:57,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 17:01:57,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:57,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:57,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:58,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:58,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-03 17:01:58,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:58,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:01:58,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:01:58,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:01:58,794 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 43 states. [2018-12-03 17:01:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:59,281 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-12-03 17:01:59,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:01:59,282 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-03 17:01:59,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:59,282 INFO L225 Difference]: With dead ends: 129 [2018-12-03 17:01:59,283 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:01:59,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 126 SyntacticMatches, 80 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1872 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:01:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:01:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:01:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:01:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 17:01:59,290 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 84 [2018-12-03 17:01:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:59,290 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 17:01:59,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:01:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 17:01:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:01:59,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:59,291 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1, 1] [2018-12-03 17:01:59,291 INFO L423 AbstractCegarLoop]: === Iteration 120 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:59,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash -86651705, now seen corresponding path program 117 times [2018-12-03 17:01:59,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:59,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:59,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:59,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:59,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:59,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:59,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:59,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:59,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:59,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:59,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:59,991 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:00,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:00,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:00,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:00,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:01,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 820 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:01,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:01,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-03 17:02:01,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:01,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:02:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:02:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:02:01,653 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-03 17:02:01,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:01,788 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-12-03 17:02:01,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:02:01,789 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-03 17:02:01,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:01,789 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:02:01,789 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 17:02:01,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 126 SyntacticMatches, 80 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:02:01,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 17:02:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 17:02:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 17:02:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-12-03 17:02:01,797 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 84 [2018-12-03 17:02:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:01,797 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-12-03 17:02:01,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:02:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-12-03 17:02:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:02:01,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:01,798 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1] [2018-12-03 17:02:01,798 INFO L423 AbstractCegarLoop]: === Iteration 121 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:01,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1608702919, now seen corresponding path program 118 times [2018-12-03 17:02:01,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:01,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:01,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:01,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:01,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:02,708 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 17:02:02,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:02,708 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:02,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:02,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:02,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:02,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:02,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:02,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:02,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:02,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 17:02:02,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:02,834 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 17:02:02,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:02,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 17:02:02,853 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:02,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:02:02,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:02:02,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:02:02,854 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 43 states. [2018-12-03 17:02:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:04,939 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2018-12-03 17:02:04,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:02:04,939 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 85 [2018-12-03 17:02:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:04,940 INFO L225 Difference]: With dead ends: 131 [2018-12-03 17:02:04,940 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 17:02:04,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 205 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:02:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 17:02:04,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 88. [2018-12-03 17:02:04,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:02:04,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-12-03 17:02:04,948 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 85 [2018-12-03 17:02:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:04,948 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-12-03 17:02:04,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:02:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-12-03 17:02:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:02:04,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:04,949 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-12-03 17:02:04,949 INFO L423 AbstractCegarLoop]: === Iteration 122 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:04,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:04,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1669878585, now seen corresponding path program 119 times [2018-12-03 17:02:04,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:04,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:04,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:04,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:05,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:05,952 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:05,952 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:05,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:05,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:05,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:05,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:05,961 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:06,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:02:06,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:06,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:06,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:07,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:07,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 17:02:07,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:07,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:02:07,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:02:07,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:02:07,327 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 44 states. [2018-12-03 17:02:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:07,680 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 17:02:07,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:02:07,680 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-03 17:02:07,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:07,681 INFO L225 Difference]: With dead ends: 132 [2018-12-03 17:02:07,681 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 17:02:07,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 129 SyntacticMatches, 82 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1960 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:02:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 17:02:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 17:02:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 17:02:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-03 17:02:07,689 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 86 [2018-12-03 17:02:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:07,689 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-03 17:02:07,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:02:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-03 17:02:07,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:02:07,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:07,690 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1, 1, 1] [2018-12-03 17:02:07,690 INFO L423 AbstractCegarLoop]: === Iteration 123 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:07,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:07,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1752850541, now seen corresponding path program 120 times [2018-12-03 17:02:07,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:07,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:07,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:07,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:07,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:08,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:08,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:08,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:08,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:08,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:08,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:08,455 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:08,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:08,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:08,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:08,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:08,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:09,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:09,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:09,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 17:02:09,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:09,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:02:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:02:09,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:02:09,810 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-03 17:02:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:09,931 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-12-03 17:02:09,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:02:09,932 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-03 17:02:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:09,932 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:02:09,933 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 17:02:09,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 129 SyntacticMatches, 82 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:02:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 17:02:09,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 17:02:09,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:02:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-03 17:02:09,940 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-03 17:02:09,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:09,940 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-03 17:02:09,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:02:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-03 17:02:09,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:02:09,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:09,941 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1] [2018-12-03 17:02:09,941 INFO L423 AbstractCegarLoop]: === Iteration 124 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:09,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:09,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1496269599, now seen corresponding path program 121 times [2018-12-03 17:02:09,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:09,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:09,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:09,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:11,311 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 17:02:11,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:11,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:11,312 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:11,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 17:02:11,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:11,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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:11,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:11,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:11,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:11,401 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 17:02:11,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:11,425 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 17:02:11,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:11,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-03 17:02:11,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:11,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:02:11,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:02:11,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:02:11,447 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 44 states. [2018-12-03 17:02:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:13,615 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2018-12-03 17:02:13,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:02:13,616 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 87 [2018-12-03 17:02:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:13,616 INFO L225 Difference]: With dead ends: 134 [2018-12-03 17:02:13,616 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 17:02:13,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:02:13,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 17:02:13,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2018-12-03 17:02:13,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:02:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-12-03 17:02:13,623 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 87 [2018-12-03 17:02:13,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:13,623 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-12-03 17:02:13,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:02:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-12-03 17:02:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 17:02:13,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:13,623 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-12-03 17:02:13,624 INFO L423 AbstractCegarLoop]: === Iteration 125 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:13,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash 860221165, now seen corresponding path program 122 times [2018-12-03 17:02:13,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:13,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:13,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:13,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:13,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:14,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:14,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:14,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:14,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:14,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:14,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:14,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:14,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:14,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:02:14,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:14,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:14,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:15,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:15,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:15,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-03 17:02:15,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:15,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:02:15,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:02:15,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:02:15,665 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 45 states. [2018-12-03 17:02:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:16,217 INFO L93 Difference]: Finished difference Result 135 states and 137 transitions. [2018-12-03 17:02:16,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:02:16,218 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-03 17:02:16,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:16,218 INFO L225 Difference]: With dead ends: 135 [2018-12-03 17:02:16,218 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:02:16,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 132 SyntacticMatches, 84 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2050 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:02:16,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:02:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 17:02:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:02:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-03 17:02:16,223 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 88 [2018-12-03 17:02:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:16,223 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-03 17:02:16,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:02:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-03 17:02:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 17:02:16,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:16,224 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1, 1] [2018-12-03 17:02:16,224 INFO L423 AbstractCegarLoop]: === Iteration 126 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:16,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:16,224 INFO L82 PathProgramCache]: Analyzing trace with hash -409358329, now seen corresponding path program 123 times [2018-12-03 17:02:16,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:16,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:16,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:16,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:16,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:17,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:17,018 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:17,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:17,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:17,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:17,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:17,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:17,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:17,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:17,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:18,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 903 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:18,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:18,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-03 17:02:18,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:18,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:02:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:02:18,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:02:18,398 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-03 17:02:18,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:18,519 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-12-03 17:02:18,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:02:18,520 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-03 17:02:18,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:18,520 INFO L225 Difference]: With dead ends: 93 [2018-12-03 17:02:18,520 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 17:02:18,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 132 SyntacticMatches, 84 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1764 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:02:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 17:02:18,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 17:02:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:02:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-12-03 17:02:18,526 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 88 [2018-12-03 17:02:18,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:18,527 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-12-03 17:02:18,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:02:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-12-03 17:02:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:02:18,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:18,527 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1] [2018-12-03 17:02:18,527 INFO L423 AbstractCegarLoop]: === Iteration 127 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:18,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash 194732167, now seen corresponding path program 124 times [2018-12-03 17:02:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:18,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:18,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:18,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:18,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:19,504 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 17:02:19,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:19,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:19,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:19,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:19,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:19,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:19,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:19,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:19,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:19,591 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 17:02:19,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:19,616 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 17:02:19,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:19,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 17:02:19,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:19,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:02:19,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:02:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:02:19,636 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 45 states. [2018-12-03 17:02:22,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:22,077 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-12-03 17:02:22,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:02:22,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2018-12-03 17:02:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:22,078 INFO L225 Difference]: With dead ends: 137 [2018-12-03 17:02:22,078 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 17:02:22,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 215 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:02:22,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 17:02:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 92. [2018-12-03 17:02:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:02:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-12-03 17:02:22,084 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 89 [2018-12-03 17:02:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:22,084 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-12-03 17:02:22,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:02:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-12-03 17:02:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:02:22,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:22,085 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-12-03 17:02:22,086 INFO L423 AbstractCegarLoop]: === Iteration 128 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:22,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:22,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1741668359, now seen corresponding path program 125 times [2018-12-03 17:02:22,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:22,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:22,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:22,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:22,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:22,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:22,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:22,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:22,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:22,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:22,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:22,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:22,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:22,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 17:02:22,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:22,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:22,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:24,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:24,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 17:02:24,259 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:24,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:02:24,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:02:24,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:02:24,260 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 46 states. [2018-12-03 17:02:24,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:24,832 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-12-03 17:02:24,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:02:24,834 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-03 17:02:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:24,834 INFO L225 Difference]: With dead ends: 138 [2018-12-03 17:02:24,835 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 17:02:24,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 135 SyntacticMatches, 86 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2142 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:02:24,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 17:02:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 17:02:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 17:02:24,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 17:02:24,842 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 90 [2018-12-03 17:02:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:24,842 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 17:02:24,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:02:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 17:02:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:02:24,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:24,843 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1, 1, 1] [2018-12-03 17:02:24,843 INFO L423 AbstractCegarLoop]: === Iteration 129 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:24,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:24,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1039409709, now seen corresponding path program 126 times [2018-12-03 17:02:24,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:24,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:24,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:24,844 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:24,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:25,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:25,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:25,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:25,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:25,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:25,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:25,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:25,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:25,630 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:25,680 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:25,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:25,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:25,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:25,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:27,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 946 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:27,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:27,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 17:02:27,411 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:27,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:02:27,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:02:27,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:02:27,412 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-03 17:02:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:27,540 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-12-03 17:02:27,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:02:27,541 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-03 17:02:27,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:27,541 INFO L225 Difference]: With dead ends: 95 [2018-12-03 17:02:27,541 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:02:27,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 135 SyntacticMatches, 86 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1849 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:02:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:02:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 17:02:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:02:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-12-03 17:02:27,548 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2018-12-03 17:02:27,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:27,548 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-12-03 17:02:27,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:02:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-12-03 17:02:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 17:02:27,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:27,549 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1] [2018-12-03 17:02:27,549 INFO L423 AbstractCegarLoop]: === Iteration 130 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:27,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:27,549 INFO L82 PathProgramCache]: Analyzing trace with hash -2138098911, now seen corresponding path program 127 times [2018-12-03 17:02:27,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:27,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:27,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:27,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:28,584 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 17:02:28,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:28,584 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:28,584 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:28,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:28,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:28,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:28,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:28,596 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:28,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:28,681 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 17:02:28,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:28,706 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 17:02:28,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:28,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-03 17:02:28,725 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:28,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:02:28,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:02:28,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:02:28,726 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 46 states. [2018-12-03 17:02:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:31,206 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-12-03 17:02:31,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:02:31,206 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 91 [2018-12-03 17:02:31,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:31,207 INFO L225 Difference]: With dead ends: 140 [2018-12-03 17:02:31,207 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 17:02:31,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 220 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:02:31,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 17:02:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 94. [2018-12-03 17:02:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:02:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-12-03 17:02:31,211 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 91 [2018-12-03 17:02:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:31,212 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-12-03 17:02:31,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:02:31,212 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-12-03 17:02:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 17:02:31,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:31,212 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-12-03 17:02:31,213 INFO L423 AbstractCegarLoop]: === Iteration 131 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:31,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:31,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1856618323, now seen corresponding path program 128 times [2018-12-03 17:02:31,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:31,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:31,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:31,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:31,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:32,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:32,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:32,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:32,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:32,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:32,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:32,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:32,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:32,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:32,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 17:02:32,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:32,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:32,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:33,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:33,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-03 17:02:33,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:33,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:02:33,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:02:33,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:02:33,533 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 47 states. [2018-12-03 17:02:33,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:33,951 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2018-12-03 17:02:33,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:02:33,951 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-03 17:02:33,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:33,952 INFO L225 Difference]: With dead ends: 141 [2018-12-03 17:02:33,952 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 17:02:33,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 138 SyntacticMatches, 88 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:02:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 17:02:33,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 17:02:33,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:02:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 17:02:33,958 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 92 [2018-12-03 17:02:33,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:33,959 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 17:02:33,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:02:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 17:02:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 17:02:33,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:33,959 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1, 1] [2018-12-03 17:02:33,960 INFO L423 AbstractCegarLoop]: === Iteration 132 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:33,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:33,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2143167303, now seen corresponding path program 129 times [2018-12-03 17:02:33,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:33,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:33,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:33,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:33,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:34,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:34,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:34,771 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:34,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:34,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:34,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:34,780 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:34,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:34,832 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:34,832 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:34,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:34,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 990 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:36,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:36,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-03 17:02:36,589 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:36,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:02:36,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:02:36,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:02:36,590 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-03 17:02:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:36,721 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-12-03 17:02:36,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:02:36,721 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-03 17:02:36,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:36,722 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:02:36,722 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 17:02:36,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 138 SyntacticMatches, 88 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:02:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 17:02:36,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 17:02:36,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:02:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-12-03 17:02:36,730 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 92 [2018-12-03 17:02:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:36,730 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-12-03 17:02:36,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:02:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-12-03 17:02:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 17:02:36,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:36,731 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1] [2018-12-03 17:02:36,731 INFO L423 AbstractCegarLoop]: === Iteration 133 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:36,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash 2013615431, now seen corresponding path program 130 times [2018-12-03 17:02:36,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:36,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:36,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:37,945 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 17:02:37,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:37,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:37,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:37,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:37,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:37,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:37,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:37,954 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:38,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:38,034 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 17:02:38,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:38,059 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 17:02:38,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:38,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 17:02:38,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:38,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:02:38,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:02:38,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:02:38,081 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 47 states. [2018-12-03 17:02:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:40,585 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2018-12-03 17:02:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:02:40,586 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 93 [2018-12-03 17:02:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:40,587 INFO L225 Difference]: With dead ends: 143 [2018-12-03 17:02:40,587 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 17:02:40,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 225 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:02:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 17:02:40,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2018-12-03 17:02:40,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:02:40,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-12-03 17:02:40,594 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 93 [2018-12-03 17:02:40,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:40,594 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-12-03 17:02:40,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:02:40,594 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-12-03 17:02:40,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 17:02:40,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:40,595 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-12-03 17:02:40,595 INFO L423 AbstractCegarLoop]: === Iteration 134 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:40,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:40,595 INFO L82 PathProgramCache]: Analyzing trace with hash -2002492601, now seen corresponding path program 131 times [2018-12-03 17:02:40,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:40,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:40,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:40,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:40,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:41,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:41,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:41,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:41,764 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:41,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:41,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:41,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:41,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:41,773 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:41,844 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 17:02:41,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:41,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:41,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:43,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:43,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:43,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 17:02:43,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:43,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:02:43,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:02:43,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:02:43,308 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 48 states. [2018-12-03 17:02:43,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:43,952 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-12-03 17:02:43,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:02:43,952 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-03 17:02:43,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:43,953 INFO L225 Difference]: With dead ends: 144 [2018-12-03 17:02:43,953 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:02:43,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 141 SyntacticMatches, 90 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2332 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:02:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:02:43,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 17:02:43,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 17:02:43,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-03 17:02:43,959 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 94 [2018-12-03 17:02:43,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:43,959 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-03 17:02:43,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:02:43,960 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-03 17:02:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 17:02:43,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:43,960 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1, 1, 1] [2018-12-03 17:02:43,960 INFO L423 AbstractCegarLoop]: === Iteration 135 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:43,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1731777517, now seen corresponding path program 132 times [2018-12-03 17:02:43,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:43,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:43,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:43,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:43,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:44,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:44,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:44,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:44,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:44,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:44,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:44,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:44,833 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:44,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:44,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:44,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:44,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:44,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:46,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 1035 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:46,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:46,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 17:02:46,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:46,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:02:46,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:02:46,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:02:46,378 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-03 17:02:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:46,604 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-03 17:02:46,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:02:46,604 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-03 17:02:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:46,605 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:02:46,605 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 17:02:46,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 141 SyntacticMatches, 90 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:02:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 17:02:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 17:02:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:02:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-03 17:02:46,611 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2018-12-03 17:02:46,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:46,611 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-03 17:02:46,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:02:46,611 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-03 17:02:46,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 17:02:46,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:46,612 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1] [2018-12-03 17:02:46,612 INFO L423 AbstractCegarLoop]: === Iteration 136 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:46,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:46,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2145433953, now seen corresponding path program 133 times [2018-12-03 17:02:46,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:46,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:46,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:46,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:46,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:47,738 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 17:02:47,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:47,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:47,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:47,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:47,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:47,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:47,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:47,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:47,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:47,829 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 17:02:47,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:47,855 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 17:02:47,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:47,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-03 17:02:47,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:47,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:02:47,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:02:47,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:02:47,875 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 48 states. [2018-12-03 17:02:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:50,491 INFO L93 Difference]: Finished difference Result 146 states and 148 transitions. [2018-12-03 17:02:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:02:50,492 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 95 [2018-12-03 17:02:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:50,492 INFO L225 Difference]: With dead ends: 146 [2018-12-03 17:02:50,492 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 17:02:50,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:02:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 17:02:50,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 98. [2018-12-03 17:02:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:02:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-12-03 17:02:50,499 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 95 [2018-12-03 17:02:50,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:50,500 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-12-03 17:02:50,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:02:50,500 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-12-03 17:02:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 17:02:50,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:50,500 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-12-03 17:02:50,500 INFO L423 AbstractCegarLoop]: === Iteration 137 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:50,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:50,500 INFO L82 PathProgramCache]: Analyzing trace with hash 2083881581, now seen corresponding path program 134 times [2018-12-03 17:02:50,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:50,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:50,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:50,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:51,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:51,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:51,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:51,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:51,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:51,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:51,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:51,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:51,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:51,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 17:02:51,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:51,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:51,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:53,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:53,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-03 17:02:53,142 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:53,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:02:53,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:02:53,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:02:53,143 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 49 states. [2018-12-03 17:02:53,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:53,416 INFO L93 Difference]: Finished difference Result 147 states and 149 transitions. [2018-12-03 17:02:53,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:02:53,416 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-03 17:02:53,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:53,417 INFO L225 Difference]: With dead ends: 147 [2018-12-03 17:02:53,417 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 17:02:53,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 144 SyntacticMatches, 92 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2430 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:02:53,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 17:02:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 17:02:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 17:02:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 17:02:53,424 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 96 [2018-12-03 17:02:53,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:53,424 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 17:02:53,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:02:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 17:02:53,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 17:02:53,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:53,425 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1, 1] [2018-12-03 17:02:53,425 INFO L423 AbstractCegarLoop]: === Iteration 138 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:53,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:53,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1882138247, now seen corresponding path program 135 times [2018-12-03 17:02:53,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:53,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:53,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:53,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:53,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:54,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:54,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:54,292 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:54,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:54,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:54,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:54,309 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:54,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:54,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:54,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:54,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:54,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1081 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:55,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:55,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-03 17:02:55,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:55,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:02:55,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:02:55,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:02:55,932 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-03 17:02:56,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:56,105 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-12-03 17:02:56,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:02:56,106 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-03 17:02:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:56,106 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:02:56,107 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:02:56,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 144 SyntacticMatches, 92 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:02:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:02:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 17:02:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:02:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2018-12-03 17:02:56,114 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 96 [2018-12-03 17:02:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:56,114 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2018-12-03 17:02:56,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:02:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2018-12-03 17:02:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 17:02:56,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:56,114 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1] [2018-12-03 17:02:56,114 INFO L423 AbstractCegarLoop]: === Iteration 139 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:56,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1783318009, now seen corresponding path program 136 times [2018-12-03 17:02:56,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:56,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:56,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:56,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:57,557 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 17:02:57,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:57,557 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:57,557 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:57,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:57,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:57,558 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:57,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:57,566 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:57,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:57,648 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 17:02:57,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:57,674 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 17:02:57,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:57,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 17:02:57,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:57,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:02:57,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:02:57,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:02:57,694 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand 49 states. [2018-12-03 17:03:00,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:00,424 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-12-03 17:03:00,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:03:00,424 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 97 [2018-12-03 17:03:00,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:00,425 INFO L225 Difference]: With dead ends: 149 [2018-12-03 17:03:00,425 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 17:03:00,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 235 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:03:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 17:03:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2018-12-03 17:03:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:03:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-12-03 17:03:00,432 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 97 [2018-12-03 17:03:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:00,432 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-12-03 17:03:00,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:03:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-12-03 17:03:00,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:03:00,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:00,432 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-12-03 17:03:00,433 INFO L423 AbstractCegarLoop]: === Iteration 140 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:00,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:00,433 INFO L82 PathProgramCache]: Analyzing trace with hash 551655047, now seen corresponding path program 137 times [2018-12-03 17:03:00,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:00,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:00,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:01,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:01,287 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:01,287 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:01,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 17:03:01,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:01,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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:01,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:01,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:01,370 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 17:03:01,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:01,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:01,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:03,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:03,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 17:03:03,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:03,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:03:03,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:03:03,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:03:03,201 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 50 states. [2018-12-03 17:03:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:03,616 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2018-12-03 17:03:03,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:03:03,617 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-03 17:03:03,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:03,617 INFO L225 Difference]: With dead ends: 150 [2018-12-03 17:03:03,618 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:03:03,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 147 SyntacticMatches, 94 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2530 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:03:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:03:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 17:03:03,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 17:03:03,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 17:03:03,624 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 98 [2018-12-03 17:03:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:03,624 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 17:03:03,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:03:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 17:03:03,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:03:03,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:03,625 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1, 1, 1] [2018-12-03 17:03:03,625 INFO L423 AbstractCegarLoop]: === Iteration 141 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:03,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1407421011, now seen corresponding path program 138 times [2018-12-03 17:03:03,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:03,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:03,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:03,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:04,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:04,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:04,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:04,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:04,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:04,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:04,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:04,542 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:04,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:04,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:04,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:04,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:06,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 1128 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:06,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:06,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 17:03:06,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:06,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:03:06,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:03:06,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:03:06,230 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-03 17:03:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:06,456 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-12-03 17:03:06,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:03:06,457 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-03 17:03:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:06,457 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:03:06,458 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 17:03:06,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 147 SyntacticMatches, 94 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:03:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 17:03:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 17:03:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:03:06,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-03 17:03:06,465 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-03 17:03:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:06,465 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-03 17:03:06,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:03:06,465 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-03 17:03:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:03:06,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:06,465 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1] [2018-12-03 17:03:06,466 INFO L423 AbstractCegarLoop]: === Iteration 142 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:06,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:06,466 INFO L82 PathProgramCache]: Analyzing trace with hash -680439903, now seen corresponding path program 139 times [2018-12-03 17:03:06,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:06,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:06,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:06,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:07,973 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 17:03:07,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:07,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:07,973 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:07,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:07,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:07,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:07,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:07,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:08,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:08,073 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 17:03:08,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:08,099 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 17:03:08,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:08,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-03 17:03:08,119 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:08,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:03:08,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:03:08,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:03:08,120 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 50 states. [2018-12-03 17:03:11,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:11,017 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2018-12-03 17:03:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:03:11,017 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 99 [2018-12-03 17:03:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:11,018 INFO L225 Difference]: With dead ends: 152 [2018-12-03 17:03:11,018 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 17:03:11,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 240 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:03:11,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 17:03:11,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2018-12-03 17:03:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 17:03:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-12-03 17:03:11,026 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 99 [2018-12-03 17:03:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:11,026 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-12-03 17:03:11,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:03:11,026 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-12-03 17:03:11,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:03:11,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:11,027 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-12-03 17:03:11,027 INFO L423 AbstractCegarLoop]: === Iteration 143 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:11,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 381137965, now seen corresponding path program 140 times [2018-12-03 17:03:11,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:11,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:11,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:11,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:11,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:11,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:11,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:11,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:11,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:11,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:11,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:11,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:11,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:12,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 17:03:12,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:12,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:12,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:13,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:13,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-03 17:03:13,905 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:13,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:03:13,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:03:13,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:03:13,906 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 51 states. [2018-12-03 17:03:14,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:14,274 INFO L93 Difference]: Finished difference Result 153 states and 155 transitions. [2018-12-03 17:03:14,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:03:14,274 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-03 17:03:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:14,275 INFO L225 Difference]: With dead ends: 153 [2018-12-03 17:03:14,275 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:03:14,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 150 SyntacticMatches, 96 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2632 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:03:14,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:03:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 17:03:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 17:03:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-03 17:03:14,284 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 100 [2018-12-03 17:03:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:14,284 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-03 17:03:14,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:03:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-03 17:03:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:03:14,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:14,285 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1, 1] [2018-12-03 17:03:14,285 INFO L423 AbstractCegarLoop]: === Iteration 144 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:14,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash -220677689, now seen corresponding path program 141 times [2018-12-03 17:03:14,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:14,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:14,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:14,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:14,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:15,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:15,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:15,280 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:15,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:15,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:15,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:15,289 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:15,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:15,348 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:15,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:15,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:15,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:17,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1176 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:17,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:17,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-03 17:03:17,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:17,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:03:17,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:03:17,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:03:17,059 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-03 17:03:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:17,284 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-12-03 17:03:17,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:03:17,284 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-03 17:03:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:17,285 INFO L225 Difference]: With dead ends: 105 [2018-12-03 17:03:17,285 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 17:03:17,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 150 SyntacticMatches, 96 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:03:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 17:03:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 17:03:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 17:03:17,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-12-03 17:03:17,291 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 100 [2018-12-03 17:03:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:17,291 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-12-03 17:03:17,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:03:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-12-03 17:03:17,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 17:03:17,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:17,292 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1] [2018-12-03 17:03:17,292 INFO L423 AbstractCegarLoop]: === Iteration 145 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:17,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:17,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1748864711, now seen corresponding path program 142 times [2018-12-03 17:03:17,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:17,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:17,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:17,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:17,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:18,584 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 17:03:18,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:18,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:18,585 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:18,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:18,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:18,585 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:18,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:18,594 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:18,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:18,683 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 17:03:18,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:18,712 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 17:03:18,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:18,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 17:03:18,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:18,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:03:18,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:03:18,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:03:18,732 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 51 states. [2018-12-03 17:03:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:21,749 INFO L93 Difference]: Finished difference Result 155 states and 157 transitions. [2018-12-03 17:03:21,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:03:21,750 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 101 [2018-12-03 17:03:21,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:21,750 INFO L225 Difference]: With dead ends: 155 [2018-12-03 17:03:21,750 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 17:03:21,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 245 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:03:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 17:03:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 104. [2018-12-03 17:03:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:03:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-03 17:03:21,758 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 101 [2018-12-03 17:03:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:21,758 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-03 17:03:21,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:03:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-03 17:03:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 17:03:21,759 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:21,759 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-12-03 17:03:21,759 INFO L423 AbstractCegarLoop]: === Iteration 146 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:21,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:21,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1619830329, now seen corresponding path program 143 times [2018-12-03 17:03:21,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:21,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:21,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:21,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:21,760 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:22,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:22,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:22,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:22,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:22,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:22,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:22,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:22,976 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:23,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 17:03:23,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:23,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:23,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:24,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:24,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 17:03:24,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:24,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:03:24,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:03:24,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:03:24,759 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 52 states. [2018-12-03 17:03:25,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:25,055 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-12-03 17:03:25,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:03:25,056 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-03 17:03:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:25,057 INFO L225 Difference]: With dead ends: 156 [2018-12-03 17:03:25,057 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 17:03:25,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 153 SyntacticMatches, 98 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2736 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:03:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 17:03:25,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 17:03:25,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 17:03:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-03 17:03:25,064 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 102 [2018-12-03 17:03:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:25,064 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-03 17:03:25,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:03:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-03 17:03:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 17:03:25,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:25,065 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1, 1, 1] [2018-12-03 17:03:25,065 INFO L423 AbstractCegarLoop]: === Iteration 147 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:25,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:25,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1198720877, now seen corresponding path program 144 times [2018-12-03 17:03:25,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:25,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:25,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:25,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:25,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:26,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:26,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:26,055 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:26,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:26,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:26,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:26,066 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:26,066 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:26,123 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:26,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:26,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:26,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 1225 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:28,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:28,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 17:03:28,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:28,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:03:28,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:03:28,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:03:28,160 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-03 17:03:28,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:28,365 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-12-03 17:03:28,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:03:28,365 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-03 17:03:28,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:28,366 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:03:28,366 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 17:03:28,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 153 SyntacticMatches, 98 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2401 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:03:28,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 17:03:28,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 17:03:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:03:28,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-12-03 17:03:28,373 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2018-12-03 17:03:28,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:28,373 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-12-03 17:03:28,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:03:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-12-03 17:03:28,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:03:28,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:28,374 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1] [2018-12-03 17:03:28,374 INFO L423 AbstractCegarLoop]: === Iteration 148 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:28,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1494419999, now seen corresponding path program 145 times [2018-12-03 17:03:28,374 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:28,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:28,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:28,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:28,375 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:29,648 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 17:03:29,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:29,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:29,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:29,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:29,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:29,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:29,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:29,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:29,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:29,749 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 17:03:29,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:29,777 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 17:03:29,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:29,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-03 17:03:29,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:29,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:03:29,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:03:29,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:03:29,797 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 52 states. [2018-12-03 17:03:33,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:33,108 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-12-03 17:03:33,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:03:33,109 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 103 [2018-12-03 17:03:33,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:33,109 INFO L225 Difference]: With dead ends: 158 [2018-12-03 17:03:33,110 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 17:03:33,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 250 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:03:33,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 17:03:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 106. [2018-12-03 17:03:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:03:33,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-03 17:03:33,117 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 103 [2018-12-03 17:03:33,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:33,117 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-03 17:03:33,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:03:33,117 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-03 17:03:33,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:03:33,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:33,118 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-12-03 17:03:33,118 INFO L423 AbstractCegarLoop]: === Iteration 149 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:33,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:33,118 INFO L82 PathProgramCache]: Analyzing trace with hash 917558765, now seen corresponding path program 146 times [2018-12-03 17:03:33,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:33,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:33,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:33,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:33,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:34,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:34,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:34,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:34,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:34,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:34,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 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:34,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:34,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:34,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 17:03:34,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:34,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:34,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:36,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:36,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 17:03:36,021 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:36,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:03:36,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:03:36,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:03:36,022 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 53 states. [2018-12-03 17:03:36,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:36,478 INFO L93 Difference]: Finished difference Result 159 states and 161 transitions. [2018-12-03 17:03:36,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:03:36,478 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-03 17:03:36,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:36,479 INFO L225 Difference]: With dead ends: 159 [2018-12-03 17:03:36,479 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:03:36,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 156 SyntacticMatches, 100 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2842 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:03:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:03:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 17:03:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 17:03:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 17:03:36,486 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2018-12-03 17:03:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:36,486 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 17:03:36,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:03:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 17:03:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:03:36,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:36,487 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1, 1] [2018-12-03 17:03:36,487 INFO L423 AbstractCegarLoop]: === Iteration 150 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:36,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1901667065, now seen corresponding path program 147 times [2018-12-03 17:03:36,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:36,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:36,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:36,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:37,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:37,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:37,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:37,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:37,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:37,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:37,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:37,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:37,596 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:37,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:37,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:37,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:37,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:39,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1275 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:39,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:39,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 17:03:39,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:39,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:03:39,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:03:39,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:03:39,645 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-03 17:03:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:39,815 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-12-03 17:03:39,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:03:39,815 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-03 17:03:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:39,816 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:03:39,816 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:03:39,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 156 SyntacticMatches, 100 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:03:39,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:03:39,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 17:03:39,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:03:39,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2018-12-03 17:03:39,824 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 104 [2018-12-03 17:03:39,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:39,824 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2018-12-03 17:03:39,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:03:39,824 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2018-12-03 17:03:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 17:03:39,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:39,824 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1] [2018-12-03 17:03:39,825 INFO L423 AbstractCegarLoop]: === Iteration 151 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:39,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:39,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1177801607, now seen corresponding path program 148 times [2018-12-03 17:03:39,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:39,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:39,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:39,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:39,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:39,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:41,161 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 17:03:41,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:41,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:41,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:41,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:41,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:41,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:41,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:41,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:41,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:41,262 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 17:03:41,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:41,292 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 17:03:41,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:41,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 17:03:41,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:41,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:03:41,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:03:41,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:03:41,312 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand 53 states. [2018-12-03 17:03:44,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:44,764 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-12-03 17:03:44,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:03:44,765 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 105 [2018-12-03 17:03:44,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:44,766 INFO L225 Difference]: With dead ends: 161 [2018-12-03 17:03:44,766 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 17:03:44,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 255 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:03:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 17:03:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 108. [2018-12-03 17:03:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:03:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-03 17:03:44,773 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 105 [2018-12-03 17:03:44,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:44,773 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-03 17:03:44,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:03:44,773 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-03 17:03:44,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 17:03:44,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:44,774 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-12-03 17:03:44,774 INFO L423 AbstractCegarLoop]: === Iteration 152 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:44,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:44,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2142917369, now seen corresponding path program 149 times [2018-12-03 17:03:44,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:44,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:44,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:44,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:44,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:45,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:45,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:45,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:45,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:45,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:45,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:45,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:45,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:45,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:45,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 17:03:45,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:45,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:45,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:47,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:47,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 17:03:47,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:47,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:03:47,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:03:47,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:03:47,713 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 54 states. [2018-12-03 17:03:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:48,410 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-03 17:03:48,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:03:48,411 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-03 17:03:48,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:48,412 INFO L225 Difference]: With dead ends: 162 [2018-12-03 17:03:48,412 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:03:48,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 159 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:03:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:03:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 17:03:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 17:03:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-03 17:03:48,421 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 106 [2018-12-03 17:03:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:48,422 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-03 17:03:48,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:03:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-03 17:03:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 17:03:48,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:48,422 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1, 1, 1] [2018-12-03 17:03:48,423 INFO L423 AbstractCegarLoop]: === Iteration 153 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:48,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash 655395117, now seen corresponding path program 150 times [2018-12-03 17:03:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:48,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:48,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:48,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:49,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:49,515 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:49,515 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:49,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:49,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:49,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:49,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:49,524 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:49,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:49,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:49,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:49,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1326 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:51,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:51,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 17:03:51,539 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:51,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:03:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:03:51,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:03:51,540 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-03 17:03:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:51,805 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-03 17:03:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:03:51,805 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-03 17:03:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:51,806 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:03:51,806 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 17:03:51,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 159 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2601 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:03:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 17:03:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 17:03:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:03:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-03 17:03:51,814 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2018-12-03 17:03:51,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:51,814 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-03 17:03:51,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:03:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-03 17:03:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 17:03:51,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:51,814 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1] [2018-12-03 17:03:51,815 INFO L423 AbstractCegarLoop]: === Iteration 154 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:51,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1157649375, now seen corresponding path program 151 times [2018-12-03 17:03:51,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:51,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:51,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:51,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:51,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:53,527 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 17:03:53,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:53,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:53,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:53,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:53,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:53,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:53,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:53,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:53,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:53,634 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 17:03:53,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:53,671 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 17:03:53,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:53,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 17:03:53,695 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:53,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:03:53,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:03:53,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:03:53,695 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 54 states. [2018-12-03 17:03:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:57,117 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-12-03 17:03:57,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:03:57,117 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 107 [2018-12-03 17:03:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:57,118 INFO L225 Difference]: With dead ends: 164 [2018-12-03 17:03:57,118 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 17:03:57,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 260 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:03:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 17:03:57,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2018-12-03 17:03:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 17:03:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-12-03 17:03:57,134 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 107 [2018-12-03 17:03:57,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:57,134 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-12-03 17:03:57,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:03:57,134 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-12-03 17:03:57,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:03:57,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:57,135 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-12-03 17:03:57,135 INFO L423 AbstractCegarLoop]: === Iteration 155 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:57,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:57,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1527453779, now seen corresponding path program 152 times [2018-12-03 17:03:57,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:57,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:57,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:57,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:58,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:58,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:58,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:58,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:58,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:58,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:58,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:58,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:58,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 17:03:58,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:58,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:58,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:00,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:00,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:00,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-03 17:04:00,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:00,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:04:00,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:04:00,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:04:00,520 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 55 states. [2018-12-03 17:04:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:00,879 INFO L93 Difference]: Finished difference Result 165 states and 167 transitions. [2018-12-03 17:04:00,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:04:00,879 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-03 17:04:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:00,880 INFO L225 Difference]: With dead ends: 165 [2018-12-03 17:04:00,880 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:04:00,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 162 SyntacticMatches, 104 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3060 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:04:00,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:04:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:04:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:04:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 17:04:00,890 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 108 [2018-12-03 17:04:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:00,890 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 17:04:00,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:04:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 17:04:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:04:00,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:00,891 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1, 1] [2018-12-03 17:04:00,891 INFO L423 AbstractCegarLoop]: === Iteration 156 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:00,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash -679112633, now seen corresponding path program 153 times [2018-12-03 17:04:00,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:00,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:00,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:00,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:00,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:02,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:02,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:02,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:02,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:02,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:02,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:02,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:02,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:02,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:02,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:02,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:02,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1378 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:04,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:04,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-03 17:04:04,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:04,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:04:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:04:04,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:04:04,375 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-03 17:04:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:04,554 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-12-03 17:04:04,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:04:04,554 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-03 17:04:04,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:04,555 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:04:04,555 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 17:04:04,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 162 SyntacticMatches, 104 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2704 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:04:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 17:04:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 17:04:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 17:04:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-12-03 17:04:04,562 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 108 [2018-12-03 17:04:04,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:04,562 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-12-03 17:04:04,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:04:04,563 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-12-03 17:04:04,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 17:04:04,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:04,563 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1] [2018-12-03 17:04:04,563 INFO L423 AbstractCegarLoop]: === Iteration 157 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:04,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:04,563 INFO L82 PathProgramCache]: Analyzing trace with hash 422283335, now seen corresponding path program 154 times [2018-12-03 17:04:04,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:04,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:04,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:04,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:05,988 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 17:04:05,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:05,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:05,989 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:05,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:05,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:05,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:05,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:05,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:06,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:06,099 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 17:04:06,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:06,130 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 17:04:06,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:06,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 17:04:06,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:06,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:04:06,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:04:06,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:04:06,150 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 55 states. [2018-12-03 17:04:09,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:09,786 INFO L93 Difference]: Finished difference Result 167 states and 169 transitions. [2018-12-03 17:04:09,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:04:09,786 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 109 [2018-12-03 17:04:09,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:09,787 INFO L225 Difference]: With dead ends: 167 [2018-12-03 17:04:09,787 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 17:04:09,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 265 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:04:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 17:04:09,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 112. [2018-12-03 17:04:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:04:09,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-12-03 17:04:09,796 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 109 [2018-12-03 17:04:09,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:09,796 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-12-03 17:04:09,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:04:09,796 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-12-03 17:04:09,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 17:04:09,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:09,796 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-12-03 17:04:09,796 INFO L423 AbstractCegarLoop]: === Iteration 158 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:09,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash 205819975, now seen corresponding path program 155 times [2018-12-03 17:04:09,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:09,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:09,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:09,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:10,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:10,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:10,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:10,833 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:10,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:10,833 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:10,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:10,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:10,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 17:04:10,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:10,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:10,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:12,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:12,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 17:04:12,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:12,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:04:12,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:04:12,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:04:12,971 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 56 states. [2018-12-03 17:04:13,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:13,307 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2018-12-03 17:04:13,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:04:13,308 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-03 17:04:13,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:13,309 INFO L225 Difference]: With dead ends: 168 [2018-12-03 17:04:13,309 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:04:13,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 165 SyntacticMatches, 106 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3172 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:04:13,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:04:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 17:04:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 17:04:13,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-03 17:04:13,317 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 110 [2018-12-03 17:04:13,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:13,317 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-03 17:04:13,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:04:13,317 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-03 17:04:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 17:04:13,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:13,317 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1, 1, 1] [2018-12-03 17:04:13,317 INFO L423 AbstractCegarLoop]: === Iteration 159 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:13,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:13,318 INFO L82 PathProgramCache]: Analyzing trace with hash 734591725, now seen corresponding path program 156 times [2018-12-03 17:04:13,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:13,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:13,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:13,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:13,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:15,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:15,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:15,017 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:15,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:15,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:15,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:15,025 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:15,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:15,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:15,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:15,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:15,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:17,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 1431 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:17,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:17,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 17:04:17,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:17,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:04:17,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:04:17,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:04:17,140 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-12-03 17:04:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:17,341 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-12-03 17:04:17,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:04:17,342 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-03 17:04:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:17,342 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:04:17,343 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 17:04:17,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 165 SyntacticMatches, 106 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:04:17,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 17:04:17,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 17:04:17,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:04:17,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-03 17:04:17,350 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-03 17:04:17,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:17,351 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-03 17:04:17,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:04:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-03 17:04:17,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:04:17,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:17,351 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1] [2018-12-03 17:04:17,351 INFO L423 AbstractCegarLoop]: === Iteration 160 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:17,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:17,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1297445473, now seen corresponding path program 157 times [2018-12-03 17:04:17,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:17,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:17,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:17,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:17,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:19,071 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 17:04:19,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:19,071 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:19,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:19,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:19,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:19,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:19,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:19,081 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:19,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:19,185 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 17:04:19,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:19,219 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 17:04:19,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:19,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-03 17:04:19,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:19,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:04:19,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:04:19,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:04:19,241 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 56 states. [2018-12-03 17:04:22,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:22,931 INFO L93 Difference]: Finished difference Result 170 states and 172 transitions. [2018-12-03 17:04:22,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:04:22,932 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 111 [2018-12-03 17:04:22,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:22,932 INFO L225 Difference]: With dead ends: 170 [2018-12-03 17:04:22,933 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 17:04:22,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:04:22,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 17:04:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 114. [2018-12-03 17:04:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:04:22,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-12-03 17:04:22,942 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 111 [2018-12-03 17:04:22,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:22,942 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-12-03 17:04:22,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:04:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-12-03 17:04:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 17:04:22,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:22,943 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-12-03 17:04:22,943 INFO L423 AbstractCegarLoop]: === Iteration 161 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:22,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1566042477, now seen corresponding path program 158 times [2018-12-03 17:04:22,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:22,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:22,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:22,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:22,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:24,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:24,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:24,354 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:24,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:24,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:24,354 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:24,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:24,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:24,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 17:04:24,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:24,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:24,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:26,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:26,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2018-12-03 17:04:26,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:26,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:04:26,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:04:26,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:04:26,505 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 57 states. [2018-12-03 17:04:27,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:27,038 INFO L93 Difference]: Finished difference Result 171 states and 173 transitions. [2018-12-03 17:04:27,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:04:27,038 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-03 17:04:27,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:27,039 INFO L225 Difference]: With dead ends: 171 [2018-12-03 17:04:27,039 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:04:27,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 168 SyntacticMatches, 108 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3286 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:04:27,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:04:27,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 17:04:27,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 17:04:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-03 17:04:27,047 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 112 [2018-12-03 17:04:27,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:27,047 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-03 17:04:27,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:04:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-03 17:04:27,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 17:04:27,048 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:27,048 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1, 1] [2018-12-03 17:04:27,048 INFO L423 AbstractCegarLoop]: === Iteration 162 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:27,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:27,048 INFO L82 PathProgramCache]: Analyzing trace with hash 778097543, now seen corresponding path program 159 times [2018-12-03 17:04:27,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:27,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:27,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:27,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:27,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:28,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:28,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:28,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:28,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:28,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:28,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:28,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:28,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:28,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:28,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:28,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:28,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1485 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:30,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:30,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2018-12-03 17:04:30,693 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:30,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:04:30,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:04:30,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:04:30,694 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-12-03 17:04:30,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:30,884 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-12-03 17:04:30,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:04:30,884 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-03 17:04:30,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:30,885 INFO L225 Difference]: With dead ends: 117 [2018-12-03 17:04:30,885 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:04:30,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 168 SyntacticMatches, 108 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2916 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:04:30,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:04:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 17:04:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:04:30,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-12-03 17:04:30,894 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 112 [2018-12-03 17:04:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:30,895 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-12-03 17:04:30,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:04:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-12-03 17:04:30,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:04:30,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:30,895 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1] [2018-12-03 17:04:30,896 INFO L423 AbstractCegarLoop]: === Iteration 163 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:30,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:30,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1648841465, now seen corresponding path program 160 times [2018-12-03 17:04:30,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:30,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:30,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:30,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:30,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:32,446 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 17:04:32,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:32,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:32,446 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:32,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:32,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:32,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:32,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:32,455 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:32,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:32,559 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 17:04:32,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:32,591 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 17:04:32,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:32,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 17:04:32,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:32,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:04:32,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:04:32,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:04:32,611 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 57 states. [2018-12-03 17:04:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:36,529 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-12-03 17:04:36,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:04:36,530 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 113 [2018-12-03 17:04:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:36,530 INFO L225 Difference]: With dead ends: 173 [2018-12-03 17:04:36,531 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 17:04:36,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 275 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:04:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 17:04:36,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 116. [2018-12-03 17:04:36,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 17:04:36,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-12-03 17:04:36,539 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 113 [2018-12-03 17:04:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:36,539 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-12-03 17:04:36,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:04:36,539 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-12-03 17:04:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 17:04:36,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:36,539 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-12-03 17:04:36,539 INFO L423 AbstractCegarLoop]: === Iteration 164 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:36,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:36,540 INFO L82 PathProgramCache]: Analyzing trace with hash 425460615, now seen corresponding path program 161 times [2018-12-03 17:04:36,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:36,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:36,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:36,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:37,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:37,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:37,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:37,741 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:37,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:37,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:37,741 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:37,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:37,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:37,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 17:04:37,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:37,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:37,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:40,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:40,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:40,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 17:04:40,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:40,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:04:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:04:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:04:40,101 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 58 states. [2018-12-03 17:04:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:40,675 INFO L93 Difference]: Finished difference Result 174 states and 176 transitions. [2018-12-03 17:04:40,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:04:40,675 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-03 17:04:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:40,676 INFO L225 Difference]: With dead ends: 174 [2018-12-03 17:04:40,676 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 17:04:40,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 171 SyntacticMatches, 110 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3402 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:04:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 17:04:40,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 17:04:40,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:04:40,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 17:04:40,687 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 114 [2018-12-03 17:04:40,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:40,687 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 17:04:40,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:04:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 17:04:40,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 17:04:40,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:40,688 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1, 1, 1] [2018-12-03 17:04:40,688 INFO L423 AbstractCegarLoop]: === Iteration 165 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:40,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1768971437, now seen corresponding path program 162 times [2018-12-03 17:04:40,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:40,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:40,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:40,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:40,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:41,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:41,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:41,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:41,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:41,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:41,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:41,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:41,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:41,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:42,010 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:42,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:42,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:42,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1540 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:44,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:44,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 17:04:44,334 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:44,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:04:44,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:04:44,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:04:44,335 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-12-03 17:04:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:44,579 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-12-03 17:04:44,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:04:44,580 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-03 17:04:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:44,581 INFO L225 Difference]: With dead ends: 119 [2018-12-03 17:04:44,581 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 17:04:44,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 171 SyntacticMatches, 110 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:04:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 17:04:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 17:04:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 17:04:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 117 transitions. [2018-12-03 17:04:44,590 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 117 transitions. Word has length 114 [2018-12-03 17:04:44,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:44,590 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 117 transitions. [2018-12-03 17:04:44,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:04:44,590 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 117 transitions. [2018-12-03 17:04:44,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 17:04:44,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:44,590 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1] [2018-12-03 17:04:44,590 INFO L423 AbstractCegarLoop]: === Iteration 166 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:44,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:44,591 INFO L82 PathProgramCache]: Analyzing trace with hash -996521823, now seen corresponding path program 163 times [2018-12-03 17:04:44,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:44,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:44,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:44,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:44,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:46,171 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 17:04:46,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:46,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:46,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:46,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:46,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:46,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:46,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:46,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:46,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:46,300 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 17:04:46,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:46,333 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 17:04:46,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:46,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2018-12-03 17:04:46,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:46,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:04:46,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:04:46,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:04:46,352 INFO L87 Difference]: Start difference. First operand 116 states and 117 transitions. Second operand 58 states. [2018-12-03 17:04:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:50,326 INFO L93 Difference]: Finished difference Result 176 states and 178 transitions. [2018-12-03 17:04:50,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:04:50,327 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 115 [2018-12-03 17:04:50,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:50,327 INFO L225 Difference]: With dead ends: 176 [2018-12-03 17:04:50,328 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 17:04:50,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 280 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:04:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 17:04:50,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2018-12-03 17:04:50,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 17:04:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 120 transitions. [2018-12-03 17:04:50,335 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 120 transitions. Word has length 115 [2018-12-03 17:04:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:50,336 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 120 transitions. [2018-12-03 17:04:50,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:04:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 120 transitions. [2018-12-03 17:04:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 17:04:50,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:50,336 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-12-03 17:04:50,336 INFO L423 AbstractCegarLoop]: === Iteration 167 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:50,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -827466963, now seen corresponding path program 164 times [2018-12-03 17:04:50,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:50,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:50,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:50,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:51,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:51,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:51,531 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:51,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:51,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:51,531 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:51,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:51,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:51,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 17:04:51,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:51,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:51,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:53,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:53,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 58 [2018-12-03 17:04:53,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:53,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:04:53,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:04:53,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:04:53,872 INFO L87 Difference]: Start difference. First operand 118 states and 120 transitions. Second operand 59 states. [2018-12-03 17:04:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:54,500 INFO L93 Difference]: Finished difference Result 177 states and 179 transitions. [2018-12-03 17:04:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:04:54,501 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-03 17:04:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:54,501 INFO L225 Difference]: With dead ends: 177 [2018-12-03 17:04:54,501 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 17:04:54,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 174 SyntacticMatches, 112 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3520 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:04:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 17:04:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 17:04:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 17:04:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 17:04:54,512 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 116 [2018-12-03 17:04:54,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:54,513 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 17:04:54,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:04:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 17:04:54,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 17:04:54,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:54,513 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1, 1, 1] [2018-12-03 17:04:54,513 INFO L423 AbstractCegarLoop]: === Iteration 168 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:54,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash -2128304441, now seen corresponding path program 165 times [2018-12-03 17:04:54,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:54,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:54,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:54,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:54,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:55,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:55,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:55,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:55,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:55,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:55,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:55,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:55,894 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:55,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:55,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:55,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:55,988 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1596 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:58,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:58,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 58 [2018-12-03 17:04:58,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:58,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:04:58,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:04:58,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:04:58,248 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-12-03 17:04:58,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:58,438 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-12-03 17:04:58,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:04:58,439 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-03 17:04:58,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:58,439 INFO L225 Difference]: With dead ends: 121 [2018-12-03 17:04:58,439 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 17:04:58,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 174 SyntacticMatches, 112 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3136 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:04:58,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 17:04:58,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 17:04:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 17:04:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2018-12-03 17:04:58,448 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 116 [2018-12-03 17:04:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:58,448 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2018-12-03 17:04:58,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:04:58,448 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2018-12-03 17:04:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 17:04:58,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:58,449 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1] [2018-12-03 17:04:58,449 INFO L423 AbstractCegarLoop]: === Iteration 169 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:58,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:58,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1552989753, now seen corresponding path program 166 times [2018-12-03 17:04:58,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:58,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:58,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:58,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:58,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:00,230 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 17:05:00,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:00,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:00,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:00,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:00,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:00,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:00,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:00,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:00,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:00,349 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 17:05:00,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:00,382 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 17:05:00,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:00,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 17:05:00,401 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:00,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:05:00,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:05:00,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:05:00,402 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand 59 states. [2018-12-03 17:05:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:04,452 INFO L93 Difference]: Finished difference Result 179 states and 181 transitions. [2018-12-03 17:05:04,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:05:04,452 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 117 [2018-12-03 17:05:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:04,453 INFO L225 Difference]: With dead ends: 179 [2018-12-03 17:05:04,453 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 17:05:04,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:05:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 17:05:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 120. [2018-12-03 17:05:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 17:05:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-12-03 17:05:04,462 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 117 [2018-12-03 17:05:04,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:04,462 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-12-03 17:05:04,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:05:04,462 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-12-03 17:05:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 17:05:04,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:04,463 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-12-03 17:05:04,463 INFO L423 AbstractCegarLoop]: === Iteration 170 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:04,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash -898103609, now seen corresponding path program 167 times [2018-12-03 17:05:04,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:04,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:04,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:04,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:04,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:05,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:05,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:05,783 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:05,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:05,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:05,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:05,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:05,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:05,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 17:05:05,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:05,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:05,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:08,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:08,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 17:05:08,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:08,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:05:08,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:05:08,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:05:08,148 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 60 states. [2018-12-03 17:05:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:08,730 INFO L93 Difference]: Finished difference Result 180 states and 182 transitions. [2018-12-03 17:05:08,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:05:08,730 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-03 17:05:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:08,731 INFO L225 Difference]: With dead ends: 180 [2018-12-03 17:05:08,731 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 17:05:08,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 177 SyntacticMatches, 114 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3640 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:05:08,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 17:05:08,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 17:05:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 17:05:08,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-12-03 17:05:08,739 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 118 [2018-12-03 17:05:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:08,739 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-12-03 17:05:08,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:05:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-12-03 17:05:08,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 17:05:08,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:08,740 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1, 1, 1] [2018-12-03 17:05:08,740 INFO L423 AbstractCegarLoop]: === Iteration 171 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:08,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:08,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1725607533, now seen corresponding path program 168 times [2018-12-03 17:05:08,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:08,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:08,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:08,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:08,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:10,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:10,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:10,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:10,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:10,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:10,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:10,042 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:10,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:10,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:10,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:10,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:10,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:10,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:10,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 1653 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:12,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:12,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 17:05:12,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:12,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:05:12,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:05:12,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:05:12,522 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-12-03 17:05:12,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:12,717 INFO L93 Difference]: Finished difference Result 123 states and 124 transitions. [2018-12-03 17:05:12,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:05:12,718 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-03 17:05:12,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:12,718 INFO L225 Difference]: With dead ends: 123 [2018-12-03 17:05:12,718 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 17:05:12,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 177 SyntacticMatches, 114 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3249 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:05:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 17:05:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 17:05:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 17:05:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-12-03 17:05:12,734 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 118 [2018-12-03 17:05:12,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:12,734 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-12-03 17:05:12,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:05:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-12-03 17:05:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 17:05:12,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:12,735 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1] [2018-12-03 17:05:12,735 INFO L423 AbstractCegarLoop]: === Iteration 172 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:12,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:12,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1954164449, now seen corresponding path program 169 times [2018-12-03 17:05:12,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:12,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:12,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:12,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:12,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:14,397 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 17:05:14,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:14,397 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:14,397 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:14,397 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:14,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:14,398 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:14,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:14,406 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:14,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:14,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:14,522 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 17:05:14,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:14,560 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 17:05:14,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:14,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 58 [2018-12-03 17:05:14,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:14,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:05:14,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:05:14,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:05:14,580 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 60 states. [2018-12-03 17:05:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:18,780 INFO L93 Difference]: Finished difference Result 182 states and 184 transitions. [2018-12-03 17:05:18,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:05:18,781 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 119 [2018-12-03 17:05:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:18,781 INFO L225 Difference]: With dead ends: 182 [2018-12-03 17:05:18,782 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 17:05:18,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 290 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:05:18,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 17:05:18,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 122. [2018-12-03 17:05:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 17:05:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-03 17:05:18,790 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 119 [2018-12-03 17:05:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:18,790 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-03 17:05:18,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:05:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-03 17:05:18,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 17:05:18,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:18,791 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-12-03 17:05:18,791 INFO L423 AbstractCegarLoop]: === Iteration 173 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:18,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash 449494253, now seen corresponding path program 170 times [2018-12-03 17:05:18,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:18,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:18,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:20,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:20,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:20,214 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:20,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:20,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:20,214 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:20,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:20,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:20,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 17:05:20,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:20,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:20,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:20,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:22,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:22,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 60 [2018-12-03 17:05:22,676 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:22,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:05:22,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:05:22,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:05:22,677 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 61 states. [2018-12-03 17:05:23,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:23,281 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2018-12-03 17:05:23,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:05:23,282 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-03 17:05:23,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:23,282 INFO L225 Difference]: With dead ends: 183 [2018-12-03 17:05:23,283 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 17:05:23,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 180 SyntacticMatches, 116 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3762 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:05:23,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 17:05:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 17:05:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 17:05:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 17:05:23,292 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 120 [2018-12-03 17:05:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:23,292 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 17:05:23,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:05:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 17:05:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 17:05:23,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:23,292 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1, 1, 1] [2018-12-03 17:05:23,292 INFO L423 AbstractCegarLoop]: === Iteration 174 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:23,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:23,293 INFO L82 PathProgramCache]: Analyzing trace with hash 180161031, now seen corresponding path program 171 times [2018-12-03 17:05:23,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:23,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:23,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:23,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:24,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:24,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:24,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:24,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:24,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:24,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:24,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:24,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:24,710 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:24,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:24,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:24,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1711 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:27,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:27,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 60 [2018-12-03 17:05:27,203 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:27,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:05:27,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:05:27,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:05:27,204 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-12-03 17:05:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:27,434 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2018-12-03 17:05:27,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:05:27,434 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-03 17:05:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:27,435 INFO L225 Difference]: With dead ends: 125 [2018-12-03 17:05:27,435 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 17:05:27,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 180 SyntacticMatches, 116 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3364 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:05:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 17:05:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 17:05:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 17:05:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 123 transitions. [2018-12-03 17:05:27,444 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 123 transitions. Word has length 120 [2018-12-03 17:05:27,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:27,444 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 123 transitions. [2018-12-03 17:05:27,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:05:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 123 transitions. [2018-12-03 17:05:27,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 17:05:27,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:27,445 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1] [2018-12-03 17:05:27,445 INFO L423 AbstractCegarLoop]: === Iteration 175 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:27,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:27,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1289963143, now seen corresponding path program 172 times [2018-12-03 17:05:27,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:27,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:27,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:27,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:29,352 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 17:05:29,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:29,352 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:29,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:29,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:29,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:29,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:29,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:29,361 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:29,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:29,472 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 17:05:29,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:29,507 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 17:05:29,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:29,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 17:05:29,525 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:29,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:05:29,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:05:29,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:05:29,526 INFO L87 Difference]: Start difference. First operand 122 states and 123 transitions. Second operand 61 states. [2018-12-03 17:05:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:33,920 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2018-12-03 17:05:33,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:05:33,920 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 121 [2018-12-03 17:05:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:33,921 INFO L225 Difference]: With dead ends: 185 [2018-12-03 17:05:33,921 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 17:05:33,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 295 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:05:33,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 17:05:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 124. [2018-12-03 17:05:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 17:05:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-12-03 17:05:33,930 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 121 [2018-12-03 17:05:33,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:33,931 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-12-03 17:05:33,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:05:33,931 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-12-03 17:05:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 17:05:33,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:33,931 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-12-03 17:05:33,931 INFO L423 AbstractCegarLoop]: === Iteration 176 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:33,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:33,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1334090247, now seen corresponding path program 173 times [2018-12-03 17:05:33,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:33,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:33,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:33,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:33,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:35,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:35,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:35,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:35,248 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:35,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:35,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:35,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:35,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:35,259 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:35,373 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 17:05:35,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:35,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:35,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:37,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:37,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 17:05:37,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:37,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:05:37,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:05:37,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:05:37,817 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 62 states. [2018-12-03 17:05:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:38,422 INFO L93 Difference]: Finished difference Result 186 states and 188 transitions. [2018-12-03 17:05:38,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:05:38,422 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-03 17:05:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:38,423 INFO L225 Difference]: With dead ends: 186 [2018-12-03 17:05:38,423 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 17:05:38,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 183 SyntacticMatches, 118 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3886 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:05:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 17:05:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 17:05:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 17:05:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 17:05:38,433 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 122 [2018-12-03 17:05:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:38,434 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 17:05:38,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:05:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 17:05:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 17:05:38,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:38,434 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1, 1, 1] [2018-12-03 17:05:38,434 INFO L423 AbstractCegarLoop]: === Iteration 177 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:38,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:38,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1574694957, now seen corresponding path program 174 times [2018-12-03 17:05:38,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:38,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:38,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:38,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:38,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:39,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:39,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:39,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:39,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:39,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:39,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:39,790 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:39,790 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:39,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:39,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:39,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:39,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:39,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1770 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:42,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:42,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 17:05:42,362 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:42,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:05:42,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:05:42,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:05:42,363 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-12-03 17:05:42,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:42,604 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-12-03 17:05:42,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:05:42,604 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-03 17:05:42,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:42,605 INFO L225 Difference]: With dead ends: 127 [2018-12-03 17:05:42,605 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 17:05:42,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 183 SyntacticMatches, 118 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3481 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:05:42,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 17:05:42,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 17:05:42,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 17:05:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 125 transitions. [2018-12-03 17:05:42,614 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 125 transitions. Word has length 122 [2018-12-03 17:05:42,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:42,614 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 125 transitions. [2018-12-03 17:05:42,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:05:42,614 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 125 transitions. [2018-12-03 17:05:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 17:05:42,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:42,614 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1] [2018-12-03 17:05:42,615 INFO L423 AbstractCegarLoop]: === Iteration 178 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:42,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:42,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1570841889, now seen corresponding path program 175 times [2018-12-03 17:05:42,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:42,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:42,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:42,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:42,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:42,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:44,359 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 17:05:44,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:44,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:44,360 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:44,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:44,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:44,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:44,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:44,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:44,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:44,492 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 17:05:44,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:44,527 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 17:05:44,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:44,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 60 [2018-12-03 17:05:44,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:44,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:05:44,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:05:44,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:05:44,546 INFO L87 Difference]: Start difference. First operand 124 states and 125 transitions. Second operand 62 states. [2018-12-03 17:05:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:48,744 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-12-03 17:05:48,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:05:48,744 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 123 [2018-12-03 17:05:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:48,745 INFO L225 Difference]: With dead ends: 188 [2018-12-03 17:05:48,745 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 17:05:48,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 300 SyntacticMatches, 3 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:05:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 17:05:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 126. [2018-12-03 17:05:48,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 17:05:48,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-12-03 17:05:48,753 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 123 [2018-12-03 17:05:48,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:48,753 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-12-03 17:05:48,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:05:48,754 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-12-03 17:05:48,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 17:05:48,754 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:48,754 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-12-03 17:05:48,754 INFO L423 AbstractCegarLoop]: === Iteration 179 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:48,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:48,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1451396781, now seen corresponding path program 176 times [2018-12-03 17:05:48,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:48,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:48,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:48,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:48,755 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:50,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:50,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:50,076 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:50,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:50,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:50,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:50,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:50,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:50,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 17:05:50,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:50,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:50,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:52,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:52,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:52,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 62 [2018-12-03 17:05:52,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:52,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:05:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:05:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:05:52,716 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 63 states. [2018-12-03 17:05:53,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:53,346 INFO L93 Difference]: Finished difference Result 189 states and 191 transitions. [2018-12-03 17:05:53,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:05:53,346 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-03 17:05:53,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:53,347 INFO L225 Difference]: With dead ends: 189 [2018-12-03 17:05:53,347 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 17:05:53,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 186 SyntacticMatches, 120 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4012 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:05:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 17:05:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 17:05:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 17:05:53,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-03 17:05:53,355 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 124 [2018-12-03 17:05:53,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:53,356 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-03 17:05:53,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:05:53,356 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-03 17:05:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 17:05:53,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:53,356 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1, 1, 1] [2018-12-03 17:05:53,356 INFO L423 AbstractCegarLoop]: === Iteration 180 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:53,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash 320208199, now seen corresponding path program 177 times [2018-12-03 17:05:53,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:53,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:53,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:53,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:53,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:53,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:54,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:54,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:54,740 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:54,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:54,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:54,740 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:54,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:54,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:54,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:54,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:54,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:54,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:54,842 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1830 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:57,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:57,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 62 [2018-12-03 17:05:57,414 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:57,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:05:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:05:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:05:57,415 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-12-03 17:05:57,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:57,609 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-12-03 17:05:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:05:57,609 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-03 17:05:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:57,610 INFO L225 Difference]: With dead ends: 129 [2018-12-03 17:05:57,610 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 17:05:57,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 186 SyntacticMatches, 120 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3600 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:05:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 17:05:57,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 17:05:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 17:05:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-12-03 17:05:57,619 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 124 [2018-12-03 17:05:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:57,619 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-12-03 17:05:57,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:05:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-12-03 17:05:57,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 17:05:57,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:57,620 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1] [2018-12-03 17:05:57,620 INFO L423 AbstractCegarLoop]: === Iteration 181 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:57,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:57,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1336458055, now seen corresponding path program 178 times [2018-12-03 17:05:57,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:57,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:57,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:57,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:59,426 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 17:05:59,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:59,426 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:59,427 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:59,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:59,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:59,427 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:59,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:59,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:59,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:59,553 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 17:05:59,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:59,589 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 17:05:59,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:59,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 17:05:59,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:59,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:05:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:05:59,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:05:59,609 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 63 states. [2018-12-03 17:06:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:03,961 INFO L93 Difference]: Finished difference Result 191 states and 193 transitions. [2018-12-03 17:06:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:06:03,962 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 125 [2018-12-03 17:06:03,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:03,963 INFO L225 Difference]: With dead ends: 191 [2018-12-03 17:06:03,963 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 17:06:03,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 305 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:06:03,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 17:06:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 128. [2018-12-03 17:06:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 17:06:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-12-03 17:06:03,972 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 125 [2018-12-03 17:06:03,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:03,972 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-12-03 17:06:03,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:06:03,972 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-12-03 17:06:03,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 17:06:03,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:03,972 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-12-03 17:06:03,973 INFO L423 AbstractCegarLoop]: === Iteration 182 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:03,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:03,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1519534777, now seen corresponding path program 179 times [2018-12-03 17:06:03,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:03,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:03,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:03,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:03,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:05,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:05,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:05,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:05,417 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:05,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:05,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:05,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:05,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:05,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:05,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 17:06:05,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:05,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:05,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:08,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:08,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 17:06:08,126 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:08,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:06:08,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:06:08,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:06:08,127 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 64 states. [2018-12-03 17:06:08,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:08,758 INFO L93 Difference]: Finished difference Result 192 states and 194 transitions. [2018-12-03 17:06:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:06:08,758 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-03 17:06:08,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:08,759 INFO L225 Difference]: With dead ends: 192 [2018-12-03 17:06:08,759 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 17:06:08,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 189 SyntacticMatches, 122 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:06:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 17:06:08,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 17:06:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 17:06:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-03 17:06:08,768 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 126 [2018-12-03 17:06:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:08,768 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-03 17:06:08,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:06:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-03 17:06:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 17:06:08,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:08,769 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1, 1, 1] [2018-12-03 17:06:08,769 INFO L423 AbstractCegarLoop]: === Iteration 183 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:08,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:08,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2068324845, now seen corresponding path program 180 times [2018-12-03 17:06:08,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:08,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:08,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:10,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:10,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:10,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:10,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:10,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:10,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:10,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:10,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:10,219 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:10,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:10,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:10,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:10,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 1891 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:12,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:12,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 17:06:12,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:12,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:06:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:06:12,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:06:12,914 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-12-03 17:06:13,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:13,149 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2018-12-03 17:06:13,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:06:13,150 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-03 17:06:13,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:13,150 INFO L225 Difference]: With dead ends: 131 [2018-12-03 17:06:13,150 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 17:06:13,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 189 SyntacticMatches, 122 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3721 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:06:13,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 17:06:13,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 17:06:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 17:06:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2018-12-03 17:06:13,162 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 126 [2018-12-03 17:06:13,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:13,162 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2018-12-03 17:06:13,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:06:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2018-12-03 17:06:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 17:06:13,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:13,163 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1] [2018-12-03 17:06:13,163 INFO L423 AbstractCegarLoop]: === Iteration 184 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:13,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:13,163 INFO L82 PathProgramCache]: Analyzing trace with hash -306500767, now seen corresponding path program 181 times [2018-12-03 17:06:13,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:13,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:13,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:13,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:13,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:15,026 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 17:06:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:15,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:15,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:15,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:15,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:15,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:15,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:15,034 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:15,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:15,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:15,163 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 17:06:15,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:15,201 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 17:06:15,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:15,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 62 [2018-12-03 17:06:15,220 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:15,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:06:15,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:06:15,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:06:15,221 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand 64 states. [2018-12-03 17:06:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:19,742 INFO L93 Difference]: Finished difference Result 194 states and 196 transitions. [2018-12-03 17:06:19,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:06:19,742 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 127 [2018-12-03 17:06:19,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:19,743 INFO L225 Difference]: With dead ends: 194 [2018-12-03 17:06:19,743 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 17:06:19,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 310 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:06:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 17:06:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 130. [2018-12-03 17:06:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 17:06:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-12-03 17:06:19,751 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 127 [2018-12-03 17:06:19,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:19,752 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-12-03 17:06:19,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:06:19,752 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-12-03 17:06:19,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 17:06:19,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:19,752 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-12-03 17:06:19,752 INFO L423 AbstractCegarLoop]: === Iteration 185 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:19,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:19,753 INFO L82 PathProgramCache]: Analyzing trace with hash -911650707, now seen corresponding path program 182 times [2018-12-03 17:06:19,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:19,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:19,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:19,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:21,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:21,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:21,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:21,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:21,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:21,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:21,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:21,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:21,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:21,270 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 17:06:21,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:21,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:21,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:23,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:23,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:23,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 64 [2018-12-03 17:06:23,948 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:23,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:06:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:06:23,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 17:06:23,949 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 65 states. [2018-12-03 17:06:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:24,596 INFO L93 Difference]: Finished difference Result 195 states and 197 transitions. [2018-12-03 17:06:24,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:06:24,596 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-03 17:06:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:24,597 INFO L225 Difference]: With dead ends: 195 [2018-12-03 17:06:24,597 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 17:06:24,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 192 SyntacticMatches, 124 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4270 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 17:06:24,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 17:06:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-03 17:06:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 17:06:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 17:06:24,606 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 128 [2018-12-03 17:06:24,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:24,606 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 17:06:24,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:06:24,606 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 17:06:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 17:06:24,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:24,607 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1, 1, 1] [2018-12-03 17:06:24,607 INFO L423 AbstractCegarLoop]: === Iteration 186 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:24,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1357152121, now seen corresponding path program 183 times [2018-12-03 17:06:24,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:24,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:24,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:24,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:24,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:26,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:26,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:26,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:26,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:26,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:26,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:26,104 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:26,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:26,175 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:26,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:26,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:26,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:26,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:28,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1953 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:28,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 64 [2018-12-03 17:06:28,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:28,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:06:28,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:06:28,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 17:06:28,926 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-12-03 17:06:29,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:29,131 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-12-03 17:06:29,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:06:29,131 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-03 17:06:29,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:29,132 INFO L225 Difference]: With dead ends: 133 [2018-12-03 17:06:29,132 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 17:06:29,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 192 SyntacticMatches, 124 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 17:06:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 17:06:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 17:06:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 17:06:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-12-03 17:06:29,141 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 128 [2018-12-03 17:06:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:29,141 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-12-03 17:06:29,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:06:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-12-03 17:06:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 17:06:29,142 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:29,142 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1] [2018-12-03 17:06:29,142 INFO L423 AbstractCegarLoop]: === Iteration 187 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:29,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:29,142 INFO L82 PathProgramCache]: Analyzing trace with hash 877895687, now seen corresponding path program 184 times [2018-12-03 17:06:29,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:29,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:29,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:29,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:31,104 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 17:06:31,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:31,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:31,104 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:31,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:31,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:31,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:31,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:31,113 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:31,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:31,233 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 17:06:31,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:31,272 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 17:06:31,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:31,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 17:06:31,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:31,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:06:31,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:06:31,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 17:06:31,292 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 65 states. [2018-12-03 17:06:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:35,992 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-12-03 17:06:35,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:06:35,992 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 129 [2018-12-03 17:06:35,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:35,993 INFO L225 Difference]: With dead ends: 197 [2018-12-03 17:06:35,993 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 17:06:35,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 315 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 17:06:35,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 17:06:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 132. [2018-12-03 17:06:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 17:06:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-12-03 17:06:36,005 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 129 [2018-12-03 17:06:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:36,006 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-12-03 17:06:36,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:06:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-12-03 17:06:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 17:06:36,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:36,007 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-12-03 17:06:36,007 INFO L423 AbstractCegarLoop]: === Iteration 188 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:36,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:36,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1444900999, now seen corresponding path program 185 times [2018-12-03 17:06:36,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:36,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:36,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:36,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:36,008 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:37,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:37,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:37,657 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:37,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:37,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:37,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:37,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:37,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:37,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 17:06:37,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:37,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:37,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:40,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:40,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 17:06:40,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:40,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:06:40,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:06:40,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:06:40,549 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 66 states. [2018-12-03 17:06:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:41,074 INFO L93 Difference]: Finished difference Result 198 states and 200 transitions. [2018-12-03 17:06:41,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:06:41,075 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-03 17:06:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:41,075 INFO L225 Difference]: With dead ends: 198 [2018-12-03 17:06:41,075 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 17:06:41,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 195 SyntacticMatches, 126 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:06:41,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 17:06:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 17:06:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 17:06:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-03 17:06:41,085 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 130 [2018-12-03 17:06:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:41,085 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-03 17:06:41,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:06:41,085 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-03 17:06:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 17:06:41,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:41,085 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1, 1, 1] [2018-12-03 17:06:41,086 INFO L423 AbstractCegarLoop]: === Iteration 189 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:41,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash 519259053, now seen corresponding path program 186 times [2018-12-03 17:06:41,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:41,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:41,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:41,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:41,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:42,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:42,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:42,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:42,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:42,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:42,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:42,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:42,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:42,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:42,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:42,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:42,767 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:42,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 2016 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:45,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:45,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 17:06:45,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:45,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:06:45,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:06:45,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:06:45,546 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-12-03 17:06:45,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:45,794 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-12-03 17:06:45,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:06:45,795 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-03 17:06:45,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:45,795 INFO L225 Difference]: With dead ends: 135 [2018-12-03 17:06:45,795 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 17:06:45,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 195 SyntacticMatches, 126 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3969 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:06:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 17:06:45,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 17:06:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 17:06:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-12-03 17:06:45,807 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 130 [2018-12-03 17:06:45,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:45,808 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-12-03 17:06:45,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:06:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-12-03 17:06:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 17:06:45,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:45,808 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1] [2018-12-03 17:06:45,809 INFO L423 AbstractCegarLoop]: === Iteration 190 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:45,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:45,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1082900063, now seen corresponding path program 187 times [2018-12-03 17:06:45,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:45,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:45,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:45,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:45,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:47,780 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 17:06:47,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:47,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:47,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:47,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:47,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:47,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:47,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:47,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:47,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:47,905 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 17:06:47,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:47,944 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 17:06:47,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:47,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 64 [2018-12-03 17:06:47,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:47,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:06:47,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:06:47,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:06:47,963 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 66 states. [2018-12-03 17:06:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:52,734 INFO L93 Difference]: Finished difference Result 200 states and 202 transitions. [2018-12-03 17:06:52,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:06:52,734 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 131 [2018-12-03 17:06:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:52,735 INFO L225 Difference]: With dead ends: 200 [2018-12-03 17:06:52,735 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 17:06:52,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:06:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 17:06:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 134. [2018-12-03 17:06:52,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 17:06:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-12-03 17:06:52,745 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 131 [2018-12-03 17:06:52,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:52,745 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-12-03 17:06:52,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:06:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-12-03 17:06:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 17:06:52,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:52,745 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-12-03 17:06:52,746 INFO L423 AbstractCegarLoop]: === Iteration 191 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:52,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash 789774893, now seen corresponding path program 188 times [2018-12-03 17:06:52,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:52,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:52,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:52,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:52,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:54,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:54,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:54,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:54,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:54,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:54,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:54,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:54,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:54,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 17:06:54,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:54,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:54,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:57,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:57,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 66 [2018-12-03 17:06:57,163 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:57,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:06:57,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:06:57,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:06:57,164 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 67 states. [2018-12-03 17:06:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:57,697 INFO L93 Difference]: Finished difference Result 201 states and 203 transitions. [2018-12-03 17:06:57,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:06:57,698 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-03 17:06:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:57,698 INFO L225 Difference]: With dead ends: 201 [2018-12-03 17:06:57,699 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 17:06:57,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 198 SyntacticMatches, 128 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4536 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:06:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 17:06:57,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 17:06:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 17:06:57,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 17:06:57,708 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 132 [2018-12-03 17:06:57,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:57,708 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 17:06:57,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:06:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 17:06:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 17:06:57,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:57,709 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1, 1, 1] [2018-12-03 17:06:57,709 INFO L423 AbstractCegarLoop]: === Iteration 192 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:57,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:57,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2135321657, now seen corresponding path program 189 times [2018-12-03 17:06:57,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:57,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:57,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:57,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:57,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:59,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:59,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:59,296 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:59,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:59,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:59,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:59,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:59,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:59,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:59,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:59,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:59,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:59,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 2080 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:02,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:02,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 66 [2018-12-03 17:07:02,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:02,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:07:02,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:07:02,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:07:02,261 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-12-03 17:07:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:02,488 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-12-03 17:07:02,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:07:02,488 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-03 17:07:02,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:02,489 INFO L225 Difference]: With dead ends: 137 [2018-12-03 17:07:02,489 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 17:07:02,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 198 SyntacticMatches, 128 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4096 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:07:02,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 17:07:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 17:07:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 17:07:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 135 transitions. [2018-12-03 17:07:02,500 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 135 transitions. Word has length 132 [2018-12-03 17:07:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:02,500 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 135 transitions. [2018-12-03 17:07:02,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:07:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 135 transitions. [2018-12-03 17:07:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 17:07:02,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:02,501 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1] [2018-12-03 17:07:02,501 INFO L423 AbstractCegarLoop]: === Iteration 193 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:02,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:02,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1770523449, now seen corresponding path program 190 times [2018-12-03 17:07:02,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:02,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:02,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:02,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:04,561 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 17:07:04,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:04,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:04,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:04,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:04,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:04,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:04,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:04,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:04,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:04,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:04,688 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 17:07:04,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:04,729 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 17:07:04,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:04,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 17:07:04,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:04,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:07:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:07:04,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:07:04,749 INFO L87 Difference]: Start difference. First operand 134 states and 135 transitions. Second operand 67 states. [2018-12-03 17:07:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:09,665 INFO L93 Difference]: Finished difference Result 203 states and 205 transitions. [2018-12-03 17:07:09,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:07:09,666 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 133 [2018-12-03 17:07:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:09,666 INFO L225 Difference]: With dead ends: 203 [2018-12-03 17:07:09,667 INFO L226 Difference]: Without dead ends: 200 [2018-12-03 17:07:09,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 325 SyntacticMatches, 3 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:07:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-03 17:07:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2018-12-03 17:07:09,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 17:07:09,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-03 17:07:09,676 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 133 [2018-12-03 17:07:09,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:09,677 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-03 17:07:09,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:07:09,677 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-03 17:07:09,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 17:07:09,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:09,677 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-12-03 17:07:09,677 INFO L423 AbstractCegarLoop]: === Iteration 194 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:09,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash 948286407, now seen corresponding path program 191 times [2018-12-03 17:07:09,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:09,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:09,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:09,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:09,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:11,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:11,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:11,215 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:11,215 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:11,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:11,215 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:11,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:07:11,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:07:11,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 17:07:11,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:11,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:11,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:14,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:14,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 17:07:14,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:14,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:07:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:07:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:07:14,284 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 68 states. [2018-12-03 17:07:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:15,007 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2018-12-03 17:07:15,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:07:15,007 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-03 17:07:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:15,008 INFO L225 Difference]: With dead ends: 204 [2018-12-03 17:07:15,008 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 17:07:15,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 201 SyntacticMatches, 130 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4672 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:07:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 17:07:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 17:07:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 17:07:15,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-03 17:07:15,017 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 134 [2018-12-03 17:07:15,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:15,018 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-03 17:07:15,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:07:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-03 17:07:15,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 17:07:15,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:15,018 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1, 1, 1] [2018-12-03 17:07:15,018 INFO L423 AbstractCegarLoop]: === Iteration 195 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:15,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:15,019 INFO L82 PathProgramCache]: Analyzing trace with hash 464606573, now seen corresponding path program 192 times [2018-12-03 17:07:15,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:15,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:15,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:15,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:15,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:16,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:16,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:16,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:16,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 17:07:16,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:16,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:16,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:16,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:16,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:16,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:16,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:16,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 2145 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:19,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:19,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 17:07:19,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:19,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:07:19,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:07:19,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:07:19,739 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-12-03 17:07:20,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:20,021 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-12-03 17:07:20,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:07:20,022 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-03 17:07:20,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:20,022 INFO L225 Difference]: With dead ends: 139 [2018-12-03 17:07:20,022 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 17:07:20,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 201 SyntacticMatches, 130 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4225 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:07:20,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 17:07:20,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 17:07:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 17:07:20,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 137 transitions. [2018-12-03 17:07:20,032 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 137 transitions. Word has length 134 [2018-12-03 17:07:20,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:20,032 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 137 transitions. [2018-12-03 17:07:20,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:07:20,032 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 137 transitions. [2018-12-03 17:07:20,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 17:07:20,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:20,033 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1] [2018-12-03 17:07:20,033 INFO L423 AbstractCegarLoop]: === Iteration 196 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:20,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:20,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1517840353, now seen corresponding path program 193 times [2018-12-03 17:07:20,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:20,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:20,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:20,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:20,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:22,131 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 17:07:22,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:22,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:22,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:22,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:22,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:22,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:22,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:22,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:22,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:22,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:22,267 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 17:07:22,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:22,306 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 17:07:22,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:22,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 66 [2018-12-03 17:07:22,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:22,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:07:22,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:07:22,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:07:22,326 INFO L87 Difference]: Start difference. First operand 136 states and 137 transitions. Second operand 68 states. [2018-12-03 17:07:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:27,416 INFO L93 Difference]: Finished difference Result 206 states and 208 transitions. [2018-12-03 17:07:27,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:07:27,416 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 135 [2018-12-03 17:07:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:27,417 INFO L225 Difference]: With dead ends: 206 [2018-12-03 17:07:27,417 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 17:07:27,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 330 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:07:27,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 17:07:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 138. [2018-12-03 17:07:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 17:07:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-12-03 17:07:27,427 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 135 [2018-12-03 17:07:27,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:27,427 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-12-03 17:07:27,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:07:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-12-03 17:07:27,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 17:07:27,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:27,428 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-12-03 17:07:27,428 INFO L423 AbstractCegarLoop]: === Iteration 197 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:27,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:27,428 INFO L82 PathProgramCache]: Analyzing trace with hash -191650835, now seen corresponding path program 194 times [2018-12-03 17:07:27,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:27,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:27,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:27,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:27,429 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:29,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:29,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:29,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:29,010 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:29,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:29,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:29,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:29,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:07:29,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:07:29,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 17:07:29,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:29,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:29,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:32,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:32,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:32,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 68 [2018-12-03 17:07:32,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:32,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:07:32,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:07:32,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 17:07:32,114 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 69 states. [2018-12-03 17:07:32,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:32,864 INFO L93 Difference]: Finished difference Result 207 states and 209 transitions. [2018-12-03 17:07:32,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:07:32,864 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-03 17:07:32,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:32,865 INFO L225 Difference]: With dead ends: 207 [2018-12-03 17:07:32,865 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 17:07:32,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 204 SyntacticMatches, 132 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4810 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 17:07:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 17:07:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-03 17:07:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 17:07:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-03 17:07:32,876 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 136 [2018-12-03 17:07:32,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:32,876 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-03 17:07:32,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:07:32,876 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-03 17:07:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 17:07:32,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:32,877 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1, 1, 1] [2018-12-03 17:07:32,877 INFO L423 AbstractCegarLoop]: === Iteration 198 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:32,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1994143495, now seen corresponding path program 195 times [2018-12-03 17:07:32,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:32,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:32,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:32,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:34,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:34,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:34,576 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:34,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:34,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:34,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:34,585 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:34,585 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:34,662 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:34,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:34,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:34,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:34,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2211 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:37,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:37,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 68 [2018-12-03 17:07:37,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:37,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:07:37,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:07:37,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 17:07:37,744 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-12-03 17:07:38,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:38,020 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2018-12-03 17:07:38,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:07:38,020 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-03 17:07:38,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:38,021 INFO L225 Difference]: With dead ends: 141 [2018-12-03 17:07:38,021 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 17:07:38,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 204 SyntacticMatches, 132 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 17:07:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 17:07:38,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 17:07:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 17:07:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-12-03 17:07:38,033 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 136 [2018-12-03 17:07:38,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:38,033 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-12-03 17:07:38,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:07:38,033 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-12-03 17:07:38,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 17:07:38,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:38,033 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1] [2018-12-03 17:07:38,033 INFO L423 AbstractCegarLoop]: === Iteration 199 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:38,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:38,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1688844679, now seen corresponding path program 196 times [2018-12-03 17:07:38,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:38,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:38,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:38,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:40,189 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 17:07:40,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:40,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:40,189 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:40,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:40,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:40,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:40,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:40,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:40,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:40,327 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 17:07:40,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:40,368 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 17:07:40,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:40,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 17:07:40,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:40,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:07:40,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:07:40,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 17:07:40,388 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 69 states. [2018-12-03 17:07:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:45,640 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-12-03 17:07:45,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:07:45,641 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 137 [2018-12-03 17:07:45,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:45,641 INFO L225 Difference]: With dead ends: 209 [2018-12-03 17:07:45,641 INFO L226 Difference]: Without dead ends: 206 [2018-12-03 17:07:45,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 335 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 17:07:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-03 17:07:45,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 140. [2018-12-03 17:07:45,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 17:07:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-12-03 17:07:45,651 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 137 [2018-12-03 17:07:45,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:45,651 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-12-03 17:07:45,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:07:45,651 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-12-03 17:07:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 17:07:45,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:45,652 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-12-03 17:07:45,652 INFO L423 AbstractCegarLoop]: === Iteration 200 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:45,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:45,652 INFO L82 PathProgramCache]: Analyzing trace with hash 814515975, now seen corresponding path program 197 times [2018-12-03 17:07:45,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:45,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:45,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:45,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:45,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:47,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:47,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:47,276 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:47,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:47,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:47,276 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:47,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:07:47,284 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:07:47,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 17:07:47,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:47,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:47,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:50,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:50,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 17:07:50,464 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:50,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:07:50,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:07:50,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:07:50,465 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 70 states. [2018-12-03 17:07:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:51,266 INFO L93 Difference]: Finished difference Result 210 states and 212 transitions. [2018-12-03 17:07:51,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:07:51,266 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-03 17:07:51,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:51,267 INFO L225 Difference]: With dead ends: 210 [2018-12-03 17:07:51,267 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 17:07:51,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 207 SyntacticMatches, 134 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:07:51,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 17:07:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 17:07:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 17:07:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 17:07:51,277 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 138 [2018-12-03 17:07:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:51,277 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 17:07:51,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:07:51,277 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 17:07:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 17:07:51,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:51,277 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1, 1, 1] [2018-12-03 17:07:51,278 INFO L423 AbstractCegarLoop]: === Iteration 201 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:51,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:51,278 INFO L82 PathProgramCache]: Analyzing trace with hash -145336531, now seen corresponding path program 198 times [2018-12-03 17:07:51,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:51,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:51,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:51,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:51,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:53,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:53,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:53,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:53,006 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:53,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:53,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:53,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 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:53,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:53,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:53,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:53,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:53,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:53,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2278 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:56,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:56,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 17:07:56,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:56,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:07:56,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:07:56,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:07:56,243 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-12-03 17:07:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:56,471 INFO L93 Difference]: Finished difference Result 143 states and 144 transitions. [2018-12-03 17:07:56,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:07:56,471 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-03 17:07:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:56,472 INFO L225 Difference]: With dead ends: 143 [2018-12-03 17:07:56,472 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 17:07:56,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 207 SyntacticMatches, 134 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4489 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:07:56,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 17:07:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 17:07:56,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 17:07:56,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-12-03 17:07:56,483 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 138 [2018-12-03 17:07:56,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:56,483 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-12-03 17:07:56,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:07:56,483 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-12-03 17:07:56,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 17:07:56,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:56,483 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1] [2018-12-03 17:07:56,483 INFO L423 AbstractCegarLoop]: === Iteration 202 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:56,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:56,484 INFO L82 PathProgramCache]: Analyzing trace with hash -210526687, now seen corresponding path program 199 times [2018-12-03 17:07:56,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:56,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:56,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:56,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:58,714 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 17:07:58,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:58,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:58,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:58,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:58,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:58,715 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:58,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:58,722 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:58,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:58,845 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 17:07:58,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:58,889 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 17:07:58,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:58,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 68 [2018-12-03 17:07:58,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:58,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:07:58,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:07:58,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:07:58,908 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 70 states. [2018-12-03 17:08:04,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:04,326 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-03 17:08:04,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:08:04,326 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 139 [2018-12-03 17:08:04,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:04,327 INFO L225 Difference]: With dead ends: 212 [2018-12-03 17:08:04,327 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 17:08:04,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 340 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:08:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 17:08:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 142. [2018-12-03 17:08:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 17:08:04,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2018-12-03 17:08:04,340 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 139 [2018-12-03 17:08:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:04,340 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2018-12-03 17:08:04,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:08:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2018-12-03 17:08:04,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 17:08:04,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:04,341 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-12-03 17:08:04,341 INFO L423 AbstractCegarLoop]: === Iteration 203 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:04,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:04,341 INFO L82 PathProgramCache]: Analyzing trace with hash 2063545773, now seen corresponding path program 200 times [2018-12-03 17:08:04,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:04,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:04,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:08:04,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:04,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:06,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:06,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:06,021 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:06,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:06,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:06,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:06,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:08:06,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:08:06,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 17:08:06,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:08:06,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:06,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 70 [2018-12-03 17:08:09,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:09,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:08:09,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:08:09,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:08:09,308 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 71 states. [2018-12-03 17:08:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:10,144 INFO L93 Difference]: Finished difference Result 213 states and 215 transitions. [2018-12-03 17:08:10,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:08:10,145 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-03 17:08:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:10,146 INFO L225 Difference]: With dead ends: 213 [2018-12-03 17:08:10,146 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 17:08:10,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 210 SyntacticMatches, 136 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5092 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:08:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 17:08:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 17:08:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 17:08:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 17:08:10,158 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 140 [2018-12-03 17:08:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:10,158 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 17:08:10,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:08:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 17:08:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 17:08:10,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:10,159 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1, 1, 1] [2018-12-03 17:08:10,159 INFO L423 AbstractCegarLoop]: === Iteration 204 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:10,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1922078137, now seen corresponding path program 201 times [2018-12-03 17:08:10,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:10,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:08:10,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:10,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:11,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:11,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:11,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:11,941 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:11,941 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:11,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:11,941 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:11,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:08:11,950 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:08:12,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:08:12,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:08:12,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:12,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:12,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2346 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:15,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:15,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 70 [2018-12-03 17:08:15,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:15,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:08:15,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:08:15,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:08:15,262 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-12-03 17:08:15,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:15,489 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-12-03 17:08:15,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:08:15,489 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-03 17:08:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:15,490 INFO L225 Difference]: With dead ends: 145 [2018-12-03 17:08:15,490 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 17:08:15,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 210 SyntacticMatches, 136 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4624 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:08:15,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 17:08:15,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 17:08:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 17:08:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 143 transitions. [2018-12-03 17:08:15,503 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 143 transitions. Word has length 140 [2018-12-03 17:08:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:15,503 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 143 transitions. [2018-12-03 17:08:15,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:08:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 143 transitions. [2018-12-03 17:08:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 17:08:15,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:15,504 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1] [2018-12-03 17:08:15,504 INFO L423 AbstractCegarLoop]: === Iteration 205 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:15,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:15,504 INFO L82 PathProgramCache]: Analyzing trace with hash 545058375, now seen corresponding path program 202 times [2018-12-03 17:08:15,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:15,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:15,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:08:15,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:15,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:17,786 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 17:08:17,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:17,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:17,786 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:17,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:17,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:17,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:17,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:08:17,795 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:08:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:17,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:17,936 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 17:08:17,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:17,981 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 17:08:18,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:18,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 17:08:18,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:18,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:08:18,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:08:18,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:08:18,001 INFO L87 Difference]: Start difference. First operand 142 states and 143 transitions. Second operand 71 states. [2018-12-03 17:08:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:23,567 INFO L93 Difference]: Finished difference Result 215 states and 217 transitions. [2018-12-03 17:08:23,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:08:23,568 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 141 [2018-12-03 17:08:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:23,569 INFO L225 Difference]: With dead ends: 215 [2018-12-03 17:08:23,569 INFO L226 Difference]: Without dead ends: 212 [2018-12-03 17:08:23,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 345 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:08:23,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-03 17:08:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 144. [2018-12-03 17:08:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 17:08:23,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-12-03 17:08:23,580 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 141 [2018-12-03 17:08:23,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:23,580 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-12-03 17:08:23,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:08:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-12-03 17:08:23,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 17:08:23,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:23,581 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-12-03 17:08:23,581 INFO L423 AbstractCegarLoop]: === Iteration 206 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:23,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash -283121081, now seen corresponding path program 203 times [2018-12-03 17:08:23,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:23,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:23,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:08:23,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:23,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:25,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:25,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:25,360 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:25,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:25,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:25,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:25,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:08:25,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:08:25,507 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 17:08:25,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:08:25,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:25,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:28,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:28,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 17:08:28,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:28,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:08:28,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:08:28,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:08:28,741 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 72 states. [2018-12-03 17:08:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:29,321 INFO L93 Difference]: Finished difference Result 216 states and 218 transitions. [2018-12-03 17:08:29,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:08:29,322 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-03 17:08:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:29,322 INFO L225 Difference]: With dead ends: 216 [2018-12-03 17:08:29,322 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 17:08:29,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 213 SyntacticMatches, 138 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5236 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:08:29,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 17:08:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 17:08:29,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 17:08:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-12-03 17:08:29,333 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 142 [2018-12-03 17:08:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:29,333 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-12-03 17:08:29,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:08:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-12-03 17:08:29,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 17:08:29,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:29,334 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1, 1, 1] [2018-12-03 17:08:29,334 INFO L423 AbstractCegarLoop]: === Iteration 207 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:29,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash 716589293, now seen corresponding path program 204 times [2018-12-03 17:08:29,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:29,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:29,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:08:29,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:29,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:31,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:31,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:31,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:31,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:31,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:31,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:31,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:08:31,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:08:31,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:08:31,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:08:31,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:31,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 2415 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:34,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:34,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 17:08:34,589 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:34,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:08:34,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:08:34,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:08:34,590 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-12-03 17:08:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:34,876 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-12-03 17:08:34,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:08:34,876 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-03 17:08:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:34,877 INFO L225 Difference]: With dead ends: 147 [2018-12-03 17:08:34,877 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 17:08:34,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 213 SyntacticMatches, 138 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4761 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:08:34,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 17:08:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 17:08:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 17:08:34,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-12-03 17:08:34,892 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 142 [2018-12-03 17:08:34,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:34,892 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-12-03 17:08:34,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:08:34,892 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-12-03 17:08:34,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 17:08:34,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:34,893 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1] [2018-12-03 17:08:34,893 INFO L423 AbstractCegarLoop]: === Iteration 208 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:34,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:34,894 INFO L82 PathProgramCache]: Analyzing trace with hash 739370081, now seen corresponding path program 205 times [2018-12-03 17:08:34,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:34,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:08:34,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:34,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:37,366 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 17:08:37,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:37,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:37,366 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:37,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:37,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:37,367 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:37,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:08:37,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:08:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:37,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:37,506 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 17:08:37,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:37,548 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 17:08:37,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:37,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 70 [2018-12-03 17:08:37,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:37,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:08:37,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:08:37,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:08:37,567 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 72 states. [2018-12-03 17:08:43,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:43,293 INFO L93 Difference]: Finished difference Result 218 states and 220 transitions. [2018-12-03 17:08:43,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:08:43,294 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 143 [2018-12-03 17:08:43,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:43,295 INFO L225 Difference]: With dead ends: 218 [2018-12-03 17:08:43,295 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 17:08:43,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:08:43,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 17:08:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 146. [2018-12-03 17:08:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 17:08:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-12-03 17:08:43,310 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 143 [2018-12-03 17:08:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:43,311 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-12-03 17:08:43,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:08:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-12-03 17:08:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 17:08:43,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:43,311 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-12-03 17:08:43,312 INFO L423 AbstractCegarLoop]: === Iteration 209 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:43,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1445574509, now seen corresponding path program 206 times [2018-12-03 17:08:43,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:43,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:43,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:08:43,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:43,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:45,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:45,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:45,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:45,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:45,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:45,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:45,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:08:45,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:08:45,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 17:08:45,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:08:45,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:45,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:45,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:48,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 72 [2018-12-03 17:08:48,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:48,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:08:48,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:08:48,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:08:48,621 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 73 states. [2018-12-03 17:08:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:49,497 INFO L93 Difference]: Finished difference Result 219 states and 221 transitions. [2018-12-03 17:08:49,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:08:49,498 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-03 17:08:49,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:49,498 INFO L225 Difference]: With dead ends: 219 [2018-12-03 17:08:49,498 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 17:08:49,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 216 SyntacticMatches, 140 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5382 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:08:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 17:08:49,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 17:08:49,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 17:08:49,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 17:08:49,509 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 144 [2018-12-03 17:08:49,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:49,509 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 17:08:49,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:08:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 17:08:49,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 17:08:49,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:49,510 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1, 1, 1] [2018-12-03 17:08:49,510 INFO L423 AbstractCegarLoop]: === Iteration 210 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:49,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1923142265, now seen corresponding path program 207 times [2018-12-03 17:08:49,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:49,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:49,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:08:49,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:49,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:51,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:51,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:51,375 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:51,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:51,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:51,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:51,383 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:08:51,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:08:51,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:08:51,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:08:51,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:51,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:51,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2485 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:54,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:54,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 72 [2018-12-03 17:08:54,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:54,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:08:54,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:08:54,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:08:54,857 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-12-03 17:08:55,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:55,152 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-12-03 17:08:55,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:08:55,152 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-03 17:08:55,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:55,153 INFO L225 Difference]: With dead ends: 149 [2018-12-03 17:08:55,153 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 17:08:55,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 216 SyntacticMatches, 140 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:08:55,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 17:08:55,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 17:08:55,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 17:08:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 147 transitions. [2018-12-03 17:08:55,164 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 147 transitions. Word has length 144 [2018-12-03 17:08:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:55,164 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 147 transitions. [2018-12-03 17:08:55,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:08:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 147 transitions. [2018-12-03 17:08:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 17:08:55,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:55,164 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1] [2018-12-03 17:08:55,164 INFO L423 AbstractCegarLoop]: === Iteration 211 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:55,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash 512070407, now seen corresponding path program 208 times [2018-12-03 17:08:55,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:55,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:55,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:08:55,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:55,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:57,547 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 17:08:57,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:57,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:57,548 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:57,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:57,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:57,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:08:57,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:08:57,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:57,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:57,706 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 17:08:57,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:57,748 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 17:08:57,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:57,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 17:08:57,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:57,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:08:57,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:08:57,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:08:57,767 INFO L87 Difference]: Start difference. First operand 146 states and 147 transitions. Second operand 73 states. [2018-12-03 17:09:03,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:03,632 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-12-03 17:09:03,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:09:03,632 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 145 [2018-12-03 17:09:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:03,633 INFO L225 Difference]: With dead ends: 221 [2018-12-03 17:09:03,633 INFO L226 Difference]: Without dead ends: 218 [2018-12-03 17:09:03,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 355 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:09:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-03 17:09:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 148. [2018-12-03 17:09:03,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 17:09:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-12-03 17:09:03,644 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 145 [2018-12-03 17:09:03,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:03,644 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-12-03 17:09:03,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:09:03,644 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-12-03 17:09:03,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 17:09:03,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:03,645 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-12-03 17:09:03,645 INFO L423 AbstractCegarLoop]: === Iteration 212 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:03,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:03,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1305748089, now seen corresponding path program 209 times [2018-12-03 17:09:03,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:03,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:03,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:09:03,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:03,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:05,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:05,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:05,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:05,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:05,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:05,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:05,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:05,460 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:09:05,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:09:05,591 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 17:09:05,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:09:05,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:05,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:05,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:09,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:09,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 17:09:09,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:09,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:09:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:09:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:09:09,031 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 74 states. [2018-12-03 17:09:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:09,591 INFO L93 Difference]: Finished difference Result 222 states and 224 transitions. [2018-12-03 17:09:09,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:09:09,592 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-03 17:09:09,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:09,592 INFO L225 Difference]: With dead ends: 222 [2018-12-03 17:09:09,592 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 17:09:09,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 219 SyntacticMatches, 142 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5530 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:09:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 17:09:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 17:09:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 17:09:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 17:09:09,604 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 146 [2018-12-03 17:09:09,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:09,604 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 17:09:09,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:09:09,604 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 17:09:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 17:09:09,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:09,604 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1, 1, 1] [2018-12-03 17:09:09,605 INFO L423 AbstractCegarLoop]: === Iteration 213 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:09,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:09,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1638214317, now seen corresponding path program 210 times [2018-12-03 17:09:09,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:09,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:09,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:09,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:09,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:11,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:11,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:11,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:11,520 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:11,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:11,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:11,520 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:11,529 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:09:11,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:09:11,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:09:11,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:09:11,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:11,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2556 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:15,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:15,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 17:09:15,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:15,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:09:15,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:09:15,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:09:15,099 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-12-03 17:09:15,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:15,337 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2018-12-03 17:09:15,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:09:15,337 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-03 17:09:15,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:15,338 INFO L225 Difference]: With dead ends: 151 [2018-12-03 17:09:15,338 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 17:09:15,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 219 SyntacticMatches, 142 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5041 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:09:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 17:09:15,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 17:09:15,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 17:09:15,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2018-12-03 17:09:15,349 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 146 [2018-12-03 17:09:15,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:15,349 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2018-12-03 17:09:15,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:09:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2018-12-03 17:09:15,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 17:09:15,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:15,350 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1] [2018-12-03 17:09:15,350 INFO L423 AbstractCegarLoop]: === Iteration 214 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:15,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:15,350 INFO L82 PathProgramCache]: Analyzing trace with hash -755025247, now seen corresponding path program 211 times [2018-12-03 17:09:15,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:15,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:15,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:15,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:15,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:17,778 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 17:09:17,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:17,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:17,778 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:17,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:17,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:17,779 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:17,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:09:17,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:09:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:17,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:17,918 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 17:09:17,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:17,962 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 17:09:17,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:17,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 72 [2018-12-03 17:09:17,981 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:17,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:09:17,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:09:17,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:09:17,982 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand 74 states. [2018-12-03 17:09:23,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:23,987 INFO L93 Difference]: Finished difference Result 224 states and 226 transitions. [2018-12-03 17:09:23,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:09:23,987 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 147 [2018-12-03 17:09:23,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:23,988 INFO L225 Difference]: With dead ends: 224 [2018-12-03 17:09:23,988 INFO L226 Difference]: Without dead ends: 221 [2018-12-03 17:09:23,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 360 SyntacticMatches, 3 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:09:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-03 17:09:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 150. [2018-12-03 17:09:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 17:09:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-03 17:09:23,999 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 147 [2018-12-03 17:09:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:23,999 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-03 17:09:23,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:09:24,000 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-03 17:09:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 17:09:24,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:24,000 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-12-03 17:09:24,000 INFO L423 AbstractCegarLoop]: === Iteration 215 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:24,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1931007699, now seen corresponding path program 212 times [2018-12-03 17:09:24,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:24,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:09:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:24,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:24,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:25,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:25,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:25,862 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:25,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:25,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:25,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 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:25,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:09:25,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:09:26,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 17:09:26,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:09:26,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:26,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:29,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:29,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 74 [2018-12-03 17:09:29,488 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:29,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:09:29,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:09:29,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:09:29,489 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 75 states. [2018-12-03 17:09:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:30,438 INFO L93 Difference]: Finished difference Result 225 states and 227 transitions. [2018-12-03 17:09:30,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:09:30,439 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-03 17:09:30,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:30,439 INFO L225 Difference]: With dead ends: 225 [2018-12-03 17:09:30,439 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 17:09:30,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 222 SyntacticMatches, 144 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5680 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:09:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 17:09:30,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 17:09:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 17:09:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-03 17:09:30,451 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 148 [2018-12-03 17:09:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:30,451 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-03 17:09:30,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:09:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-03 17:09:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 17:09:30,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:30,451 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1, 1, 1] [2018-12-03 17:09:30,451 INFO L423 AbstractCegarLoop]: === Iteration 216 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:30,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:30,452 INFO L82 PathProgramCache]: Analyzing trace with hash -862486329, now seen corresponding path program 213 times [2018-12-03 17:09:30,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:30,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:30,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:30,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:30,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:32,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:32,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:32,419 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:32,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:32,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:32,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:32,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:09:32,435 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:09:32,517 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:09:32,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:09:32,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:32,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:36,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2628 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:36,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:36,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 74 [2018-12-03 17:09:36,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:36,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:09:36,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:09:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:09:36,094 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-12-03 17:09:36,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:36,354 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2018-12-03 17:09:36,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:09:36,354 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-03 17:09:36,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:36,355 INFO L225 Difference]: With dead ends: 153 [2018-12-03 17:09:36,355 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 17:09:36,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 222 SyntacticMatches, 144 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5184 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:09:36,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 17:09:36,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 17:09:36,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 17:09:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-12-03 17:09:36,366 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 148 [2018-12-03 17:09:36,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:36,366 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-12-03 17:09:36,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:09:36,366 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-12-03 17:09:36,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 17:09:36,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:36,366 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1] [2018-12-03 17:09:36,367 INFO L423 AbstractCegarLoop]: === Iteration 217 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:36,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:36,367 INFO L82 PathProgramCache]: Analyzing trace with hash -967333945, now seen corresponding path program 214 times [2018-12-03 17:09:36,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:36,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:36,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:36,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:38,854 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 17:09:38,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:38,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:38,855 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:38,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:38,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:38,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:38,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:09:38,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:09:38,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:38,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:39,009 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 17:09:39,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:39,056 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 17:09:39,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:39,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 17:09:39,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:39,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:09:39,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:09:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:09:39,075 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 75 states. [2018-12-03 17:09:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:45,276 INFO L93 Difference]: Finished difference Result 227 states and 229 transitions. [2018-12-03 17:09:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:09:45,276 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 149 [2018-12-03 17:09:45,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:45,277 INFO L225 Difference]: With dead ends: 227 [2018-12-03 17:09:45,277 INFO L226 Difference]: Without dead ends: 224 [2018-12-03 17:09:45,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 365 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 17:09:45,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-12-03 17:09:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 152. [2018-12-03 17:09:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 17:09:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-12-03 17:09:45,292 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 149 [2018-12-03 17:09:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:45,293 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-12-03 17:09:45,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:09:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-12-03 17:09:45,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 17:09:45,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:45,294 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-12-03 17:09:45,294 INFO L423 AbstractCegarLoop]: === Iteration 218 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:45,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:45,294 INFO L82 PathProgramCache]: Analyzing trace with hash 77357255, now seen corresponding path program 215 times [2018-12-03 17:09:45,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:45,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:09:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:45,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:47,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:47,313 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:47,313 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:47,314 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:47,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:47,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:47,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:09:47,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:09:47,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:09:47,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:09:47,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:47,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:51,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:51,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-12-03 17:09:51,063 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:51,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:09:51,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:09:51,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:09:51,064 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 76 states. [2018-12-03 17:09:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:51,824 INFO L93 Difference]: Finished difference Result 228 states and 230 transitions. [2018-12-03 17:09:51,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:09:51,824 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-03 17:09:51,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:51,825 INFO L225 Difference]: With dead ends: 228 [2018-12-03 17:09:51,825 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 17:09:51,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 225 SyntacticMatches, 146 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5832 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:09:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 17:09:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 17:09:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 17:09:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-03 17:09:51,841 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 150 [2018-12-03 17:09:51,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:51,841 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-03 17:09:51,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:09:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-03 17:09:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 17:09:51,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:51,842 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1, 1, 1] [2018-12-03 17:09:51,842 INFO L423 AbstractCegarLoop]: === Iteration 219 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:51,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1158218643, now seen corresponding path program 216 times [2018-12-03 17:09:51,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:51,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:51,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:51,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:54,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:54,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:54,571 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:54,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:54,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:54,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:54,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:09:54,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:09:54,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:09:54,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:09:54,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:54,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:58,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2701 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:58,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:58,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-12-03 17:09:58,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:58,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:09:58,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:09:58,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:09:58,332 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-12-03 17:09:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:58,574 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2018-12-03 17:09:58,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:09:58,574 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-03 17:09:58,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:58,575 INFO L225 Difference]: With dead ends: 155 [2018-12-03 17:09:58,575 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 17:09:58,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 225 SyntacticMatches, 146 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5329 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:09:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 17:09:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 17:09:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 17:09:58,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2018-12-03 17:09:58,585 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 150 [2018-12-03 17:09:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:58,586 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2018-12-03 17:09:58,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:09:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2018-12-03 17:09:58,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 17:09:58,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:58,586 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1] [2018-12-03 17:09:58,586 INFO L423 AbstractCegarLoop]: === Iteration 220 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:58,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:58,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1545101087, now seen corresponding path program 217 times [2018-12-03 17:09:58,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:58,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:58,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:58,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:58,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:01,143 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 17:10:01,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:01,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:10:01,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:10:01,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:10:01,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:01,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:10:01,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:10:01,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:10:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:01,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:01,288 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 17:10:01,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:01,340 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 17:10:01,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:01,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 74 [2018-12-03 17:10:01,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:01,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:10:01,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:10:01,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:10:01,362 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand 76 states. [2018-12-03 17:10:07,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:07,686 INFO L93 Difference]: Finished difference Result 230 states and 232 transitions. [2018-12-03 17:10:07,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:10:07,686 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 151 [2018-12-03 17:10:07,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:07,687 INFO L225 Difference]: With dead ends: 230 [2018-12-03 17:10:07,687 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 17:10:07,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:10:07,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 17:10:07,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 154. [2018-12-03 17:10:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 17:10:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2018-12-03 17:10:07,699 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 151 [2018-12-03 17:10:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:07,699 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2018-12-03 17:10:07,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:10:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2018-12-03 17:10:07,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 17:10:07,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:07,700 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-12-03 17:10:07,700 INFO L423 AbstractCegarLoop]: === Iteration 221 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:07,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:07,700 INFO L82 PathProgramCache]: Analyzing trace with hash -653554963, now seen corresponding path program 218 times [2018-12-03 17:10:07,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:07,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:07,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:10:07,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:07,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:09,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:09,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:10:09,689 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:10:09,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:10:09,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:09,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:10:09,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:10:09,698 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:10:09,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:10:09,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:10:09,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:09,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:13,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:13,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:13,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 76 [2018-12-03 17:10:13,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:13,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:10:13,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:10:13,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 17:10:13,493 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 77 states. [2018-12-03 17:10:14,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:14,433 INFO L93 Difference]: Finished difference Result 231 states and 233 transitions. [2018-12-03 17:10:14,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:10:14,433 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-03 17:10:14,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:14,434 INFO L225 Difference]: With dead ends: 231 [2018-12-03 17:10:14,434 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 17:10:14,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 228 SyntacticMatches, 148 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5986 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 17:10:14,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 17:10:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-03 17:10:14,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 17:10:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 17:10:14,445 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 152 [2018-12-03 17:10:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:14,445 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 17:10:14,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:10:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 17:10:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 17:10:14,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:14,446 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1, 1, 1] [2018-12-03 17:10:14,446 INFO L423 AbstractCegarLoop]: === Iteration 222 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:14,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:14,446 INFO L82 PathProgramCache]: Analyzing trace with hash -301702137, now seen corresponding path program 219 times [2018-12-03 17:10:14,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:14,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:14,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:10:14,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:14,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:16,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:16,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:16,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:10:16,529 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:10:16,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:10:16,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:16,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:10:16,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:10:16,537 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:10:16,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:10:16,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:10:16,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:16,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2775 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:20,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:20,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 76 [2018-12-03 17:10:20,400 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:20,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:10:20,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:10:20,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 17:10:20,401 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-12-03 17:10:20,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:20,652 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-12-03 17:10:20,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:10:20,653 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-03 17:10:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:20,653 INFO L225 Difference]: With dead ends: 157 [2018-12-03 17:10:20,654 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 17:10:20,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 228 SyntacticMatches, 148 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5476 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 17:10:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 17:10:20,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 17:10:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 17:10:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 155 transitions. [2018-12-03 17:10:20,666 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 155 transitions. Word has length 152 [2018-12-03 17:10:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:20,666 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 155 transitions. [2018-12-03 17:10:20,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:10:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 155 transitions. [2018-12-03 17:10:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 17:10:20,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:20,667 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1] [2018-12-03 17:10:20,667 INFO L423 AbstractCegarLoop]: === Iteration 223 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:20,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash -762893177, now seen corresponding path program 220 times [2018-12-03 17:10:20,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:20,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:20,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:10:20,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:20,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:23,385 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 17:10:23,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:23,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:10:23,385 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:10:23,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:10:23,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:23,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:10:23,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:10:23,394 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:10:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:23,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:23,535 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 17:10:23,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:23,583 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 17:10:23,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:23,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-12-03 17:10:23,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:23,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:10:23,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:10:23,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 17:10:23,604 INFO L87 Difference]: Start difference. First operand 154 states and 155 transitions. Second operand 77 states. [2018-12-03 17:10:30,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:30,108 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2018-12-03 17:10:30,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:10:30,109 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 153 [2018-12-03 17:10:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:30,109 INFO L225 Difference]: With dead ends: 233 [2018-12-03 17:10:30,109 INFO L226 Difference]: Without dead ends: 230 [2018-12-03 17:10:30,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 375 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 17:10:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-03 17:10:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 156. [2018-12-03 17:10:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 17:10:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-12-03 17:10:30,121 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 153 [2018-12-03 17:10:30,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:30,121 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-12-03 17:10:30,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:10:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-12-03 17:10:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 17:10:30,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:30,121 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-12-03 17:10:30,121 INFO L423 AbstractCegarLoop]: === Iteration 224 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:30,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:30,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2120053767, now seen corresponding path program 221 times [2018-12-03 17:10:30,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:30,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:10:30,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:30,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:32,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:32,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:32,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:10:32,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:10:32,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:10:32,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:32,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:10:32,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:10:32,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:10:32,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 17:10:32,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:10:32,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:32,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:36,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:36,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-12-03 17:10:36,038 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:36,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:10:36,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:10:36,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:10:36,039 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 78 states. [2018-12-03 17:10:37,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:37,019 INFO L93 Difference]: Finished difference Result 234 states and 236 transitions. [2018-12-03 17:10:37,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:10:37,020 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-03 17:10:37,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:37,020 INFO L225 Difference]: With dead ends: 234 [2018-12-03 17:10:37,020 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 17:10:37,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 231 SyntacticMatches, 150 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6142 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:10:37,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 17:10:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 17:10:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 17:10:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-03 17:10:37,032 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 154 [2018-12-03 17:10:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:37,033 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-03 17:10:37,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:10:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-03 17:10:37,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 17:10:37,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:37,034 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1, 1, 1] [2018-12-03 17:10:37,034 INFO L423 AbstractCegarLoop]: === Iteration 225 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:37,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:37,034 INFO L82 PathProgramCache]: Analyzing trace with hash 142589485, now seen corresponding path program 222 times [2018-12-03 17:10:37,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:37,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:37,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:10:37,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:37,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:39,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:39,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:39,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:10:39,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:10:39,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:10:39,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:39,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:10:39,179 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:10:39,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:10:39,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:10:39,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:10:39,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:39,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2850 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:43,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:43,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-12-03 17:10:43,157 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:43,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:10:43,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:10:43,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:10:43,158 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-12-03 17:10:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:43,410 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-12-03 17:10:43,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:10:43,411 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-03 17:10:43,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:43,411 INFO L225 Difference]: With dead ends: 159 [2018-12-03 17:10:43,411 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 17:10:43,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 231 SyntacticMatches, 150 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5625 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:10:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 17:10:43,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 17:10:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 17:10:43,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-12-03 17:10:43,423 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 154 [2018-12-03 17:10:43,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:43,423 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-12-03 17:10:43,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:10:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-12-03 17:10:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 17:10:43,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:43,424 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1] [2018-12-03 17:10:43,424 INFO L423 AbstractCegarLoop]: === Iteration 226 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:43,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:43,424 INFO L82 PathProgramCache]: Analyzing trace with hash 125245217, now seen corresponding path program 223 times [2018-12-03 17:10:43,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:43,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:43,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:10:43,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:43,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:43,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:46,127 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 17:10:46,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:46,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:10:46,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:10:46,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:10:46,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:46,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:10:46,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:10:46,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:10:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:46,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:46,276 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 17:10:46,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:46,321 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 17:10:46,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:46,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 76 [2018-12-03 17:10:46,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:46,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:10:46,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:10:46,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:10:46,341 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 78 states. [2018-12-03 17:10:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:53,004 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2018-12-03 17:10:53,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:10:53,005 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 155 [2018-12-03 17:10:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:53,005 INFO L225 Difference]: With dead ends: 236 [2018-12-03 17:10:53,005 INFO L226 Difference]: Without dead ends: 233 [2018-12-03 17:10:53,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 380 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:10:53,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-03 17:10:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 158. [2018-12-03 17:10:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 17:10:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2018-12-03 17:10:53,017 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 155 [2018-12-03 17:10:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:53,018 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2018-12-03 17:10:53,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:10:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-12-03 17:10:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 17:10:53,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:53,018 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-12-03 17:10:53,018 INFO L423 AbstractCegarLoop]: === Iteration 227 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:53,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:53,019 INFO L82 PathProgramCache]: Analyzing trace with hash -412427091, now seen corresponding path program 224 times [2018-12-03 17:10:53,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:53,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:53,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:10:53,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:53,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:55,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:55,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:55,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:10:55,114 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:10:55,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:10:55,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:55,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:10:55,121 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:10:55,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:10:55,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 17:10:55,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:10:55,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:55,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:59,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:59,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 78 [2018-12-03 17:10:59,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:59,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:10:59,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:10:59,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:10:59,149 INFO L87 Difference]: Start difference. First operand 158 states and 160 transitions. Second operand 79 states. [2018-12-03 17:10:59,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:59,784 INFO L93 Difference]: Finished difference Result 237 states and 239 transitions. [2018-12-03 17:10:59,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:10:59,784 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-03 17:10:59,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:59,785 INFO L225 Difference]: With dead ends: 237 [2018-12-03 17:10:59,785 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 17:10:59,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 234 SyntacticMatches, 152 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6300 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:10:59,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 17:10:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 17:10:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 17:10:59,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 17:10:59,797 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 156 [2018-12-03 17:10:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:59,797 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 17:10:59,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:10:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 17:10:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 17:10:59,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:59,798 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1, 1, 1] [2018-12-03 17:10:59,798 INFO L423 AbstractCegarLoop]: === Iteration 228 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:59,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1584277689, now seen corresponding path program 225 times [2018-12-03 17:10:59,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:59,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:59,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:10:59,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:59,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:01,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:01,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:01,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:01,994 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:01,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:11:01,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:01,994 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:02,002 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:11:02,002 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:11:02,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:11:02,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:11:02,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:11:02,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:02,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:11:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 2926 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:06,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:11:06,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 78 [2018-12-03 17:11:06,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:11:06,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:11:06,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:11:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:11:06,059 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-12-03 17:11:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:11:06,331 INFO L93 Difference]: Finished difference Result 161 states and 162 transitions. [2018-12-03 17:11:06,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:11:06,331 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-03 17:11:06,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:11:06,332 INFO L225 Difference]: With dead ends: 161 [2018-12-03 17:11:06,332 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 17:11:06,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 234 SyntacticMatches, 152 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5776 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:11:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 17:11:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 17:11:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 17:11:06,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2018-12-03 17:11:06,344 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 156 [2018-12-03 17:11:06,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:11:06,344 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2018-12-03 17:11:06,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:11:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2018-12-03 17:11:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 17:11:06,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:11:06,345 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1] [2018-12-03 17:11:06,345 INFO L423 AbstractCegarLoop]: === Iteration 229 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:11:06,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:11:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1868029625, now seen corresponding path program 226 times [2018-12-03 17:11:06,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:11:06,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:06,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:11:06,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:06,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:11:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:09,068 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 17:11:09,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:09,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:09,069 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:09,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:11:09,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:09,069 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:09,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:11:09,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:11:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:09,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:11:09,219 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 17:11:09,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:11:09,264 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 17:11:09,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:11:09,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-12-03 17:11:09,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:11:09,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:11:09,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:11:09,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:11:09,284 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand 79 states. [2018-12-03 17:11:16,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:11:16,149 INFO L93 Difference]: Finished difference Result 239 states and 241 transitions. [2018-12-03 17:11:16,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:11:16,153 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 157 [2018-12-03 17:11:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:11:16,153 INFO L225 Difference]: With dead ends: 239 [2018-12-03 17:11:16,153 INFO L226 Difference]: Without dead ends: 236 [2018-12-03 17:11:16,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 385 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:11:16,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-03 17:11:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 160. [2018-12-03 17:11:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 17:11:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-12-03 17:11:16,165 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 157 [2018-12-03 17:11:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:11:16,166 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-12-03 17:11:16,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:11:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-12-03 17:11:16,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 17:11:16,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:11:16,166 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-12-03 17:11:16,166 INFO L423 AbstractCegarLoop]: === Iteration 230 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:11:16,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:11:16,167 INFO L82 PathProgramCache]: Analyzing trace with hash -2074405049, now seen corresponding path program 227 times [2018-12-03 17:11:16,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:11:16,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:16,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:11:16,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:16,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:11:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:18,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:18,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:18,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:18,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:11:18,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:18,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:18,308 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:11:18,308 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:11:18,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 17:11:18,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:11:18,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:11:18,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:18,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:11:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:22,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:11:22,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-12-03 17:11:22,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:11:22,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:11:22,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:11:22,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:11:22,414 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 80 states. [2018-12-03 17:11:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:11:23,074 INFO L93 Difference]: Finished difference Result 240 states and 242 transitions. [2018-12-03 17:11:23,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:11:23,075 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-03 17:11:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:11:23,075 INFO L225 Difference]: With dead ends: 240 [2018-12-03 17:11:23,075 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 17:11:23,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 237 SyntacticMatches, 154 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6460 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:11:23,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 17:11:23,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 17:11:23,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 17:11:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-03 17:11:23,088 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 158 [2018-12-03 17:11:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:11:23,088 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-03 17:11:23,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:11:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-03 17:11:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 17:11:23,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:11:23,089 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1, 1, 1] [2018-12-03 17:11:23,089 INFO L423 AbstractCegarLoop]: === Iteration 231 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:11:23,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:11:23,089 INFO L82 PathProgramCache]: Analyzing trace with hash 252932077, now seen corresponding path program 228 times [2018-12-03 17:11:23,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:11:23,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:23,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:11:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:23,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:11:23,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:25,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:25,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:25,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:25,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:11:25,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:25,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:25,292 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:11:25,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:11:25,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:11:25,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:11:25,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:11:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:25,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:11:29,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 3003 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:29,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:11:29,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-12-03 17:11:29,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:11:29,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:11:29,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:11:29,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:11:29,447 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-12-03 17:11:29,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:11:29,709 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-12-03 17:11:29,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:11:29,709 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-03 17:11:29,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:11:29,710 INFO L225 Difference]: With dead ends: 163 [2018-12-03 17:11:29,710 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 17:11:29,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 237 SyntacticMatches, 154 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5929 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:11:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 17:11:29,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 17:11:29,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 17:11:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-12-03 17:11:29,722 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 158 [2018-12-03 17:11:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:11:29,723 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-12-03 17:11:29,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:11:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-12-03 17:11:29,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 17:11:29,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:11:29,723 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1] [2018-12-03 17:11:29,723 INFO L423 AbstractCegarLoop]: === Iteration 232 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:11:29,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:11:29,724 INFO L82 PathProgramCache]: Analyzing trace with hash -749101727, now seen corresponding path program 229 times [2018-12-03 17:11:29,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:11:29,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:29,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:11:29,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:29,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:11:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:32,516 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 17:11:32,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:32,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:32,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:32,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:11:32,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:32,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:32,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:11:32,526 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:11:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:32,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:11:32,670 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 17:11:32,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:11:32,716 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 17:11:32,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:11:32,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 78 [2018-12-03 17:11:32,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:11:32,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:11:32,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:11:32,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:11:32,735 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 80 states. [2018-12-03 17:11:39,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:11:39,707 INFO L93 Difference]: Finished difference Result 242 states and 244 transitions. [2018-12-03 17:11:39,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:11:39,708 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 159 [2018-12-03 17:11:39,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:11:39,708 INFO L225 Difference]: With dead ends: 242 [2018-12-03 17:11:39,708 INFO L226 Difference]: Without dead ends: 239 [2018-12-03 17:11:39,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 390 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:11:39,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-03 17:11:39,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 162. [2018-12-03 17:11:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 17:11:39,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-12-03 17:11:39,720 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 159 [2018-12-03 17:11:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:11:39,721 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-12-03 17:11:39,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:11:39,721 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-12-03 17:11:39,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 17:11:39,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:11:39,721 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-12-03 17:11:39,721 INFO L423 AbstractCegarLoop]: === Iteration 233 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:11:39,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:11:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1747378579, now seen corresponding path program 230 times [2018-12-03 17:11:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:11:39,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:39,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:11:39,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:39,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:11:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:41,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:41,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:41,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:41,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 17:11:41,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:41,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 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:41,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:11:41,875 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:11:42,018 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 17:11:42,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:11:42,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:11:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:42,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:11:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:46,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:11:46,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 80 [2018-12-03 17:11:46,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:11:46,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:11:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:11:46,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 17:11:46,094 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 81 states. [2018-12-03 17:11:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:11:47,176 INFO L93 Difference]: Finished difference Result 243 states and 245 transitions. [2018-12-03 17:11:47,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:11:47,177 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-03 17:11:47,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:11:47,177 INFO L225 Difference]: With dead ends: 243 [2018-12-03 17:11:47,177 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 17:11:47,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 240 SyntacticMatches, 156 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 17:11:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 17:11:47,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-03 17:11:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 17:11:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-03 17:11:47,190 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 160 [2018-12-03 17:11:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:11:47,190 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-03 17:11:47,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:11:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-03 17:11:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 17:11:47,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:11:47,190 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1, 1, 1] [2018-12-03 17:11:47,190 INFO L423 AbstractCegarLoop]: === Iteration 234 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:11:47,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:11:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1680595591, now seen corresponding path program 231 times [2018-12-03 17:11:47,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:11:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:47,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:11:47,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:47,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:11:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:49,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:49,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:49,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:49,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:11:49,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:49,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:49,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:11:49,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:11:49,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:11:49,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:11:49,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:11:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:49,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:11:53,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3081 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:53,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:11:53,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 80 [2018-12-03 17:11:53,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:11:53,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:11:53,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:11:53,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 17:11:53,683 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-12-03 17:11:53,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:11:53,995 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-12-03 17:11:53,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:11:53,995 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-03 17:11:53,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:11:53,996 INFO L225 Difference]: With dead ends: 165 [2018-12-03 17:11:53,996 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 17:11:53,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 240 SyntacticMatches, 156 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6084 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 17:11:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 17:11:54,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 17:11:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 17:11:54,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-12-03 17:11:54,013 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 160 [2018-12-03 17:11:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:11:54,013 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-12-03 17:11:54,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:11:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-12-03 17:11:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 17:11:54,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:11:54,014 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1] [2018-12-03 17:11:54,014 INFO L423 AbstractCegarLoop]: === Iteration 235 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:11:54,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:11:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash 558794247, now seen corresponding path program 232 times [2018-12-03 17:11:54,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:11:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:54,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:11:54,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:54,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:11:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:57,091 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 17:11:57,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:57,091 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:57,091 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:57,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:11:57,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:57,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:57,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:11:57,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:11:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:57,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:11:57,244 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 17:11:57,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:11:57,293 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 17:11:57,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:11:57,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-12-03 17:11:57,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:11:57,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:11:57,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:11:57,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 17:11:57,314 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 81 states. [2018-12-03 17:12:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:12:04,495 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-12-03 17:12:04,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:12:04,496 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 161 [2018-12-03 17:12:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:12:04,496 INFO L225 Difference]: With dead ends: 245 [2018-12-03 17:12:04,497 INFO L226 Difference]: Without dead ends: 242 [2018-12-03 17:12:04,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 395 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 17:12:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-03 17:12:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 164. [2018-12-03 17:12:04,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 17:12:04,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-12-03 17:12:04,509 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 161 [2018-12-03 17:12:04,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:12:04,510 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-12-03 17:12:04,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:12:04,510 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-12-03 17:12:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 17:12:04,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:12:04,510 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1, 1, 1] [2018-12-03 17:12:04,510 INFO L423 AbstractCegarLoop]: === Iteration 236 === [MainErr1ASSERT_VIOLATIONASSERT, MainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:12:04,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:12:04,510 INFO L82 PathProgramCache]: Analyzing trace with hash 142690951, now seen corresponding path program 233 times [2018-12-03 17:12:04,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:12:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:12:04,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:12:04,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:12:04,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:12:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat