java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:56:15,030 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:56:15,032 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:56:15,045 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:56:15,046 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:56:15,047 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:56:15,048 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:56:15,050 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:56:15,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:56:15,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:56:15,054 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:56:15,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:56:15,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:56:15,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:56:15,057 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:56:15,058 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:56:15,059 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:56:15,061 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:56:15,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:56:15,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:56:15,066 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:56:15,067 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:56:15,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:56:15,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:56:15,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:56:15,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:56:15,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:56:15,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:56:15,078 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:56:15,081 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:56:15,082 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:56:15,082 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:56:15,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:56:15,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:56:15,086 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:56:15,087 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:56:15,087 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:56:15,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:56:15,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:56:15,112 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:56:15,113 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:56:15,114 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:56:15,114 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:56:15,114 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:56:15,114 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:56:15,114 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:56:15,115 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:56:15,115 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:56:15,115 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:56:15,115 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:56:15,115 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:56:15,116 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:56:15,117 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:56:15,117 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:56:15,117 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:56:15,119 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:56:15,119 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:56:15,120 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:56:15,120 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:56:15,120 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:56:15,120 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:56:15,120 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:56:15,121 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:56:15,121 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:56:15,121 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:56:15,121 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:56:15,121 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:56:15,122 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:56:15,122 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:56:15,122 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:56:15,122 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:56:15,122 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:56:15,123 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:56:15,123 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:56:15,124 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:56:15,124 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:56:15,124 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:56:15,124 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:56:15,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:56:15,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:56:15,194 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:56:15,196 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:56:15,196 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:56:15,197 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl [2018-12-03 15:56:15,197 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl' [2018-12-03 15:56:15,239 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:56:15,241 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:56:15,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:56:15,242 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:56:15,242 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:56:15,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... [2018-12-03 15:56:15,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... [2018-12-03 15:56:15,281 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:56:15,281 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:56:15,281 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:56:15,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:56:15,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:56:15,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:56:15,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:56:15,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... [2018-12-03 15:56:15,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... [2018-12-03 15:56:15,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... [2018-12-03 15:56:15,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... [2018-12-03 15:56:15,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... [2018-12-03 15:56:15,309 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... [2018-12-03 15:56:15,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... [2018-12-03 15:56:15,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:56:15,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:56:15,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:56:15,316 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:56:15,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:56:15,393 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 15:56:15,394 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:56:15,394 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:56:15,589 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:56:15,589 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:56:15,590 INFO L202 PluginConnector]: Adding new model NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:56:15 BoogieIcfgContainer [2018-12-03 15:56:15,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:56:15,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:56:15,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:56:15,595 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:56:15,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:56:15" (1/2) ... [2018-12-03 15:56:15,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ec0f4f3 and model type NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:56:15, skipping insertion in model container [2018-12-03 15:56:15,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:56:15" (2/2) ... [2018-12-03 15:56:15,599 INFO L112 eAbstractionObserver]: Analyzing ICFG NeonAngel01.bpl [2018-12-03 15:56:15,609 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:56:15,617 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:56:15,636 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:56:15,671 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:56:15,672 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:56:15,672 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:56:15,672 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:56:15,672 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:56:15,672 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:56:15,673 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:56:15,673 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:56:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:56:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:56:15,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:15,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:56:15,703 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:15,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:15,711 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 15:56:15,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:15,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:15,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:15,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:15,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:15,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:56:15,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:56:15,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:56:15,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:56:15,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:56:15,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:56:15,892 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:56:15,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:15,947 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 15:56:15,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:56:15,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:56:15,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:15,962 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:56:15,962 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:56:15,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:56:15,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:56:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:56:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:56:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:56:16,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:56:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:16,005 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:56:16,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:56:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:56:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:56:16,006 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:16,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:56:16,006 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:16,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:16,007 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 15:56:16,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:16,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:16,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:16,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:16,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:16,160 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:56:16,162 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 15:56:16,217 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:56:16,217 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:56:16,369 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:56:16,371 INFO L272 AbstractInterpreter]: Visited 4 different actions 8 times. Merged at 1 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:56:16,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:16,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:56:16,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:16,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:16,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:16,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:16,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:16,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:56:16,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:16,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:56:16,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:56:16,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:56:16,683 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 15:56:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:16,710 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:56:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:56:16,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 15:56:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:16,711 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:56:16,712 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:56:16,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:56:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:56:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:56:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:56:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:56:16,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:56:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:16,715 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:56:16,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:56:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:56:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:56:16,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:16,717 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:56:16,717 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:16,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-03 15:56:16,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:16,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:16,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:16,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:16,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:16,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:16,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:16,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:16,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:16,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:16,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:16,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:16,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:56:16,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:16,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:16,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:16,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:16,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:56:16,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:16,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:56:16,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:56:16,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:56:16,947 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 15:56:17,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:17,008 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:56:17,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:56:17,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:56:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:17,011 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:56:17,011 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:56:17,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:56:17,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:56:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:56:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:56:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:56:17,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:56:17,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:17,014 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:56:17,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:56:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:56:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:56:17,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:17,015 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:56:17,016 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:17,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-12-03 15:56:17,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:17,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:17,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:17,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:17,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:17,155 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:17,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 15:56:17,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:17,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:17,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:17,174 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:17,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:17,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:17,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:17,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:17,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:17,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:56:17,453 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:17,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:56:17,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:56:17,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:56:17,454 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 15:56:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:17,523 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:56:17,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:56:17,524 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:56:17,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:17,524 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:56:17,524 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:56:17,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:56:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:56:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:56:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:56:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:56:17,528 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:56:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:17,528 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:56:17,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:56:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:56:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:56:17,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:17,529 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:56:17,529 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:17,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:17,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-12-03 15:56:17,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:17,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:17,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:17,671 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:17,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:17,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:17,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:17,672 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:17,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:17,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:17,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:17,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:17,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:17,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:17,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:17,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:17,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:56:17,881 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:17,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:56:17,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:56:17,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:56:17,882 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 15:56:17,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:17,909 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:56:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:56:17,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:56:17,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:17,911 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:56:17,911 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:56:17,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:56:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:56:17,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:56:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:56:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:56:17,914 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:56:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:17,915 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:56:17,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:56:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:56:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:56:17,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:17,916 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:56:17,916 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:17,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:17,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-12-03 15:56:17,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:17,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:18,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:18,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:18,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:18,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:18,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:18,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:18,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:18,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:18,060 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:56:18,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:18,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:18,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:18,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:56:18,545 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:18,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:56:18,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:56:18,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:56:18,546 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 15:56:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:18,580 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:56:18,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:56:18,581 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:56:18,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:18,581 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:56:18,582 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:56:18,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:56:18,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:56:18,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:56:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:56:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:56:18,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:56:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:18,587 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:56:18,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:56:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:56:18,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:56:18,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:18,588 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:56:18,588 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:18,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:18,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-12-03 15:56:18,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:18,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:18,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:18,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:18,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:18,731 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:18,732 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:18,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:18,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:18,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:18,742 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:18,742 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:18,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:18,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:18,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:18,758 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:18,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:18,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:56:18,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:18,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:56:18,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:56:18,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:56:18,915 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 15:56:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:18,942 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:56:18,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:56:18,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:56:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:18,944 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:56:18,944 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:56:18,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:56:18,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:56:18,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:56:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:56:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:56:18,948 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:56:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:18,948 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:56:18,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:56:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:56:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:56:18,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:18,949 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:56:18,949 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:18,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-12-03 15:56:18,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:18,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:18,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:19,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:19,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:19,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:19,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:19,116 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:56:19,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:19,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:56:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:56:19,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:56:19,471 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 15:56:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:19,506 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:56:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:56:19,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:56:19,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:19,508 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:56:19,508 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:56:19,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:56:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:56:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:56:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:56:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:56:19,511 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:56:19,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:19,512 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:56:19,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:56:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:56:19,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:56:19,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:19,512 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:56:19,513 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:19,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:19,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-12-03 15:56:19,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:19,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:19,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:19,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:19,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:19,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:19,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:19,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:19,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:19,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:56:19,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:19,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:19,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:20,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:56:20,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:20,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:56:20,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:56:20,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:20,070 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 15:56:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:20,141 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:56:20,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:56:20,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:56:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:20,142 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:56:20,142 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:56:20,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:56:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:56:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:56:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:56:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:56:20,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 15:56:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:20,146 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:56:20,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:56:20,146 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:56:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:56:20,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:20,146 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 15:56:20,147 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:20,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:20,147 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-12-03 15:56:20,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:20,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:20,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:20,289 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:20,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:20,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:20,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:20,299 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:20,316 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:20,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:20,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:20,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:56:20,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:20,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:56:20,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:56:20,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:56:20,567 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 15:56:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:20,634 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 15:56:20,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:56:20,634 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 15:56:20,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:20,635 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:56:20,635 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:56:20,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:56:20,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:56:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:56:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:56:20,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:56:20,640 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 15:56:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:20,640 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:56:20,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:56:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:56:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:56:20,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:20,641 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 15:56:20,641 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:20,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-12-03 15:56:20,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:20,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:20,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:20,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:20,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:20,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:20,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:20,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:20,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:20,805 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:20,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:20,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:21,098 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:21,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:56:21,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:21,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:56:21,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:56:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:56:21,119 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 15:56:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:21,144 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:56:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:56:21,145 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 15:56:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:21,146 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:56:21,146 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:56:21,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:56:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:56:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:56:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:56:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 15:56:21,151 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 15:56:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:21,151 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 15:56:21,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:56:21,151 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 15:56:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:56:21,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:21,152 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 15:56:21,152 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:21,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:21,152 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-12-03 15:56:21,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:21,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:21,418 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:21,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 15:56:21,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:21,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:21,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:21,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:21,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:56:21,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:21,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:21,920 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:21,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:21,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 15:56:21,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:21,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:56:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:56:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:56:21,945 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 15:56:21,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:21,990 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 15:56:21,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:56:21,991 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 15:56:21,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:21,992 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:56:21,992 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:56:21,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:56:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:56:21,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:56:21,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:56:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:56:21,994 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 15:56:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:21,994 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:56:21,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:56:21,995 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:56:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:56:21,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:21,995 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 15:56:21,995 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:21,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-12-03 15:56:21,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:21,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:21,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:21,997 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:22,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:22,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:22,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:22,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:22,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:22,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:22,510 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:22,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:22,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:22,518 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,518 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:22,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:56:22,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:22,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:56:22,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:56:22,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:56:22,854 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 15:56:23,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:23,010 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 15:56:23,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:56:23,011 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 15:56:23,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:23,012 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:56:23,012 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:56:23,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:56:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:56:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:56:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:56:23,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 15:56:23,077 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 15:56:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:23,077 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 15:56:23,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:56:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 15:56:23,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:56:23,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:23,078 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 15:56:23,078 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:23,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:23,079 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-12-03 15:56:23,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:23,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:23,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:23,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:23,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:23,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:23,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:23,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:23,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:23,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:23,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:23,477 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:23,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:23,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:56:23,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:23,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:56:23,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:56:23,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:56:23,841 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 15:56:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:23,902 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 15:56:23,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:56:23,903 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 15:56:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:23,903 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:56:23,904 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:56:23,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:56:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:56:23,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:56:23,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:56:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:56:23,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 15:56:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:23,909 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:56:23,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:56:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:56:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:56:23,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:23,910 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 15:56:23,910 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:23,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:23,910 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-12-03 15:56:23,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:23,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:23,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:23,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:24,085 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:24,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:24,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:24,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:24,098 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:24,099 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:24,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:56:24,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:24,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:24,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:24,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 15:56:24,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:24,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:56:24,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:56:24,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:56:24,782 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 15:56:24,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:24,817 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:56:24,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:56:24,817 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 15:56:24,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:24,818 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:56:24,818 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:56:24,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:56:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:56:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:56:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:56:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 15:56:24,823 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 15:56:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:24,823 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 15:56:24,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:56:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 15:56:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:56:24,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:24,824 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 15:56:24,824 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:24,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:24,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-12-03 15:56:24,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:24,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:24,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:24,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:25,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:25,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:25,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 15:56:25,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:25,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:25,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:25,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:25,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:25,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:25,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:25,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:25,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:56:25,503 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:25,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:56:25,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:56:25,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:56:25,504 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 15:56:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:25,535 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 15:56:25,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:56:25,535 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 15:56:25,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:25,536 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:56:25,536 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:56:25,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:56:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:56:25,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:56:25,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:56:25,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:56:25,541 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 15:56:25,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:25,541 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:56:25,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:56:25,542 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:56:25,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:56:25,542 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:25,542 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 15:56:25,543 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:25,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-12-03 15:56:25,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:25,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:25,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:25,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:26,409 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:26,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:26,409 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:26,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 15:56:26,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:26,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:26,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:26,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:26,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:26,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:27,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:56:27,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:27,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:56:27,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:56:27,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:56:27,241 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 15:56:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:27,286 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 15:56:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:56:27,286 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 15:56:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:27,287 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:56:27,287 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:56:27,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:56:27,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:56:27,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:56:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:56:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 15:56:27,292 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 15:56:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:27,292 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 15:56:27,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:56:27,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 15:56:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:56:27,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:27,293 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 15:56:27,293 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:27,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:27,293 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-12-03 15:56:27,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:27,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:27,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:27,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:27,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:27,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:27,527 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:27,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 15:56:27,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:27,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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:27,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:27,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:28,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:56:28,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:28,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:28,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:29,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:29,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 15:56:29,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:29,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:56:29,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:56:29,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:56:29,629 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 15:56:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:29,669 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 15:56:29,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:56:29,670 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 15:56:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:29,671 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:56:29,671 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:56:29,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:56:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:56:29,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:56:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:56:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:56:29,676 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 15:56:29,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:29,676 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:56:29,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:56:29,676 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:56:29,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:56:29,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:29,677 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 15:56:29,677 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:29,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:29,678 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-12-03 15:56:29,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:29,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:29,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:29,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:29,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:30,419 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:30,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:30,419 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:30,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:30,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:30,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:30,430 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:30,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:30,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:30,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:30,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:30,455 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:30,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:30,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:56:30,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:30,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:56:30,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:56:30,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:56:30,963 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 15:56:31,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:31,051 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:56:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:56:31,051 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 15:56:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:31,052 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:56:31,052 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:56:31,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:56:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:56:31,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:56:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:56:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 15:56:31,056 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 15:56:31,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:31,056 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 15:56:31,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:56:31,057 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 15:56:31,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:56:31,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:31,057 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 15:56:31,058 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:31,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:31,058 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-12-03 15:56:31,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:31,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:31,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:31,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:31,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:31,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:31,300 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:31,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:31,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:31,300 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:31,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:31,309 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:31,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:31,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:31,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:56:31,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:31,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:56:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:56:31,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:56:31,812 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 15:56:31,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:31,845 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 15:56:31,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:56:31,845 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 15:56:31,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:31,846 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:56:31,846 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:56:31,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:56:31,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:56:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:56:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:56:31,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:56:31,851 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 15:56:31,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:31,851 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:56:31,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:56:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:56:31,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:56:31,852 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:31,852 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 15:56:31,852 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:31,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:31,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-12-03 15:56:31,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:31,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:31,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:31,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:32,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:32,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:32,164 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:32,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:32,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:32,164 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:32,173 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:32,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:32,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:56:32,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:32,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:32,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:32,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:32,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 15:56:32,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:32,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:56:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:56:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:56:32,819 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 15:56:32,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:32,884 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 15:56:32,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:56:32,884 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 15:56:32,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:32,885 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:56:32,885 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:56:32,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:56:32,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:56:32,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:56:32,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:56:32,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 15:56:32,890 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 15:56:32,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:32,890 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 15:56:32,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:56:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 15:56:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:56:32,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:32,891 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 15:56:32,891 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:32,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-12-03 15:56:32,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:32,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:32,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:32,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:32,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:33,168 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:33,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:33,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:33,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:33,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:33,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:33,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:33,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:56:33,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:56:33,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:56:33,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:33,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:33,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:34,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:56:34,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:34,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:56:34,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:56:34,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:56:34,062 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 15:56:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:34,122 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 15:56:34,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:56:34,125 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 15:56:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:34,125 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:56:34,125 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:56:34,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:56:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:56:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:56:34,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:56:34,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:56:34,130 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 15:56:34,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:34,131 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:56:34,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:56:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:56:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:56:34,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:34,132 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 15:56:34,132 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:34,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-12-03 15:56:34,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:34,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:56:34,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:34,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:34,447 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:34,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:34,447 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:34,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:34,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:34,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:34,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:34,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:56:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:34,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:34,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:35,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:56:35,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:35,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:56:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:56:35,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:56:35,424 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 15:56:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:35,462 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:56:35,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:56:35,463 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 15:56:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:35,464 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:56:35,464 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:56:35,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:56:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:56:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:56:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:56:35,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 15:56:35,469 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 15:56:35,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:35,470 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 15:56:35,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:56:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 15:56:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:56:35,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:35,471 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 15:56:35,471 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:35,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-12-03 15:56:35,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:35,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:35,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:35,473 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:35,837 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:35,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:35,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:35,838 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:35,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:35,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:35,838 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:56:35,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:35,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:30,418 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:57:30,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:30,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:31,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:31,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 15:57:31,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:31,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:57:31,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:57:31,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:57:31,738 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 15:57:31,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:31,779 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 15:57:31,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:57:31,780 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 15:57:31,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:31,780 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:57:31,781 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:57:31,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:57:31,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:57:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:57:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:57:31,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:57:31,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 15:57:31,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:31,786 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:57:31,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:57:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:57:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:57:31,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:31,787 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 15:57:31,787 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:31,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:31,788 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-12-03 15:57:31,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:31,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:31,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:31,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:32,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:32,330 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:32,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:32,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:32,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:32,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:32,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:32,357 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:32,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:32,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:32,365 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:32,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:33,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:57:33,067 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:33,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:57:33,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:57:33,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:57:33,068 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 15:57:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:33,118 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 15:57:33,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:57:33,119 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 15:57:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:33,119 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:57:33,119 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:57:33,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:57:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:57:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:57:33,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:57:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 15:57:33,125 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 15:57:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:33,126 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 15:57:33,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:57:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 15:57:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:57:33,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:33,127 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 15:57:33,127 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:33,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-12-03 15:57:33,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:33,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:33,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:33,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:33,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:33,437 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:33,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:33,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:33,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:33,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:33,446 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:33,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:33,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:33,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:35,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:35,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 15:57:35,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:35,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:57:35,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:57:35,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:57:35,527 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 15:57:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:35,561 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 15:57:35,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:57:35,562 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 15:57:35,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:35,563 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:57:35,563 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:57:35,564 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:57:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:57:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:57:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:57:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:57:35,567 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 15:57:35,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:35,567 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:57:35,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:57:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:57:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:57:35,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:35,568 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 15:57:35,568 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:35,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-12-03 15:57:35,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:35,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,198 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:37,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:37,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:37,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:37,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:37,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:44,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:57:44,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:44,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:44,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:45,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:45,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 15:57:45,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:45,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:57:45,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:57:45,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:57:45,973 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 15:57:46,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:46,124 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:57:46,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:57:46,124 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 15:57:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:46,125 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:57:46,125 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:57:46,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:57:46,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:57:46,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:57:46,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:57:46,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 15:57:46,130 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 15:57:46,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:46,131 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 15:57:46,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:57:46,131 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 15:57:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:57:46,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:46,131 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 15:57:46,132 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:46,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:46,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-12-03 15:57:46,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:46,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:46,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:46,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:46,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:46,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:46,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:46,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:46,547 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:46,556 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:46,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:46,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:46,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:46,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:46,586 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:46,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:47,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:47,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 15:57:47,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:47,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:57:47,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:57:47,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:57:47,483 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 15:57:47,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:47,526 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 15:57:47,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:57:47,526 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 15:57:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:47,527 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:57:47,527 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:57:47,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:57:47,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:57:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:57:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:57:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:57:47,532 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 15:57:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:47,532 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:57:47,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:57:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:57:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:57:47,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:47,533 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 15:57:47,534 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:47,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:47,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-12-03 15:57:47,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:47,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:47,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:47,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:47,535 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:48,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:48,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:48,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:48,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:48,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:48,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:48,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:48,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:48,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:48,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:49,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:49,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 15:57:49,585 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:49,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:57:49,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:57:49,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:57:49,587 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 15:57:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:49,697 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 15:57:49,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:57:49,698 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 15:57:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:49,699 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:57:49,699 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:57:49,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:57:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:57:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:57:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:57:49,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 15:57:49,704 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 15:57:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:49,704 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 15:57:49,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:57:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 15:57:49,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:57:49,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:49,705 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 15:57:49,705 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:49,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-12-03 15:57:49,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:49,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:49,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:49,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:49,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:50,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:50,467 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:50,468 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:50,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:50,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:50,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:57:50,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:50,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:58:55,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:58:55,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:55,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:55,493 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:55,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:57,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:57,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 15:58:57,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:57,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:58:57,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:58:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:58:57,125 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 15:58:57,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:57,172 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 15:58:57,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:58:57,172 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 15:58:57,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:57,173 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:58:57,173 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:58:57,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:58:57,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:58:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:58:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:58:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 15:58:57,177 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 15:58:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:57,178 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 15:58:57,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:58:57,178 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 15:58:57,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:58:57,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:57,178 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 15:58:57,179 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:57,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:57,179 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-12-03 15:58:57,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:57,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:57,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:57,180 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:58,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:58,010 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:58,010 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:58,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 15:58:58,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:58,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:58,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:58,021 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:58,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:58,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:58,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:58,050 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:58,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:59,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:59,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 15:58:59,102 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:59,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:58:59,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:58:59,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:58:59,104 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 15:58:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:59,175 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 15:58:59,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:58:59,175 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 15:58:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:59,176 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:58:59,176 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:58:59,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:58:59,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:58:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:58:59,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:58:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 15:58:59,180 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 15:58:59,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:59,180 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 15:58:59,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:58:59,181 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 15:58:59,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:58:59,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:59,181 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 15:58:59,182 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:59,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:59,182 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-12-03 15:58:59,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:59,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:59,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:59,751 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:59,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:59,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:59,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:59,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:59,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:59,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:58:59,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:58:59,766 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:58:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:59,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:59,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:00,938 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:00,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 15:59:00,958 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:00,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:59:00,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:59:00,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:59:00,960 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 15:59:01,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:01,020 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 15:59:01,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:59:01,020 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 15:59:01,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:01,021 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:59:01,021 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:59:01,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:59:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:59:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:59:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:59:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 15:59:01,025 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 15:59:01,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:01,025 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 15:59:01,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:59:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 15:59:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:59:01,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:01,026 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 15:59:01,026 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:01,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:01,026 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-12-03 15:59:01,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:01,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:01,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:01,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:01,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:01,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:01,720 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:01,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:01,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:01,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:59:01,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:01,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:08,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:00:08,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:08,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:08,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:09,794 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:09,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:09,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 16:00:09,815 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:09,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:00:09,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:00:09,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:00:09,817 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 16:00:09,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:09,897 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 16:00:09,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:00:09,897 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 16:00:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:09,898 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:00:09,898 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:00:09,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:00:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:00:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:00:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:00:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 16:00:09,902 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 16:00:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:09,902 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 16:00:09,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:00:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 16:00:09,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:00:09,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:09,903 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 16:00:09,903 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:09,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:09,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-12-03 16:00:09,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:09,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:09,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:09,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:09,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:10,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:10,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:10,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:10,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:10,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:10,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:00:10,451 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:10,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:10,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:10,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:10,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:10,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:11,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:11,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:00:11,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:11,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:00:11,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:00:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:00:11,845 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 16:00:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:11,932 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 16:00:11,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:00:11,932 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 16:00:11,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:11,933 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:00:11,933 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:00:11,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:00:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:00:11,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:00:11,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:00:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 16:00:11,937 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 16:00:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:11,937 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 16:00:11,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:00:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 16:00:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:00:11,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:11,938 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 16:00:11,938 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:11,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-12-03 16:00:11,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:11,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:11,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:11,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:11,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:12,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:12,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:12,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:12,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:12,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:12,491 INFO 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:00:12,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:12,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:12,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:12,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:14,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:00:14,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:00:14,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:14,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:00:14,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:00:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:00:14,161 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 16:00:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:14,240 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 16:00:14,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:00:14,240 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 16:00:14,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:14,241 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:00:14,241 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:00:14,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:00:14,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:00:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:00:14,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:00:14,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 16:00:14,246 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 16:00:14,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:14,246 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 16:00:14,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:00:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 16:00:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:00:14,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:14,247 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 16:00:14,247 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:00:14,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-12-03 16:00:14,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:14,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:14,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:14,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:14,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:14,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:14,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:00:14,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:14,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:14,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:14,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:00:14,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:14,784 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:01:41,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:01:41,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:41,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:41,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:42,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:42,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:01:42,810 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:42,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:01:42,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:01:42,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:01:42,811 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 16:01:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:42,867 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 16:01:42,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:01:42,868 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 16:01:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:42,868 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:01:42,869 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:01:42,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:01:42,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:01:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:01:42,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:01:42,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 16:01:42,872 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 16:01:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:42,872 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 16:01:42,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:01:42,873 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 16:01:42,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:01:42,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:42,873 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 16:01:42,873 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:42,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:42,874 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-12-03 16:01:42,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:42,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:42,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:43,461 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:43,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:43,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:43,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:43,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:43,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:43,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01:43,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:01:43,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:01:43,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:01:43,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:01:43,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:43,504 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:43,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:45,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:45,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:01:45,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:45,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:01:45,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:01:45,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:01:45,014 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 16:01:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:45,073 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 16:01:45,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:01:45,074 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 16:01:45,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:45,075 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:01:45,075 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:01:45,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:01:45,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:01:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:01:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:01:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 16:01:45,078 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 16:01:45,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:45,078 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 16:01:45,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:01:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 16:01:45,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:01:45,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:45,079 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 16:01:45,080 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:45,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:45,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-12-03 16:01:45,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:45,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:45,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:01:45,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:45,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:45,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:45,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:45,917 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:45,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:45,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:45,917 INFO 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:01:45,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:45,926 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:45,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:45,959 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:45,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:47,764 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:47,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:01:47,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:01:47,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:47,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:01:47,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:01:47,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:01:47,784 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 16:01:47,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:01:47,848 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 16:01:47,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:01:47,849 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 16:01:47,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:01:47,849 INFO L225 Difference]: With dead ends: 44 [2018-12-03 16:01:47,850 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 16:01:47,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:01:47,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 16:01:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 16:01:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:01:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 16:01:47,853 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 16:01:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:01:47,853 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 16:01:47,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:01:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 16:01:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:01:47,854 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:01:47,854 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 16:01:47,854 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:01:47,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:01:47,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-12-03 16:01:47,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:01:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:47,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:01:47,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:01:47,856 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:01:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:48,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:48,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:01:48,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:01:48,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:01:48,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:01:48,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01:48,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:01:48,661 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:03:14,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:03:14,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:15,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:15,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:16,891 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:16,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:16,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 16:03:16,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:16,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:03:16,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:03:16,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:03:16,899 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 16:03:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:16,967 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 16:03:16,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:03:16,968 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 16:03:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:16,968 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:03:16,969 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:03:16,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:03:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:03:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:03:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:03:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 16:03:16,972 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 16:03:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:16,973 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 16:03:16,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:03:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 16:03:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:03:16,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:16,973 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 16:03:16,974 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:16,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:16,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-12-03 16:03:16,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:16,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:16,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:16,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:16,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:17,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:17,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:17,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:17,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 16:03:17,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:17,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 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:03:17,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:03:17,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:03:17,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:03:17,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:03:17,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:17,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:19,402 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:19,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:19,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:03:19,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:19,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:03:19,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:03:19,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:03:19,423 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 16:03:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:19,470 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 16:03:19,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:03:19,470 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 16:03:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:19,471 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:03:19,471 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:03:19,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:03:19,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:03:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:03:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:03:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 16:03:19,475 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 16:03:19,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:19,475 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 16:03:19,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:03:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 16:03:19,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:03:19,476 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:19,476 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 16:03:19,476 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:19,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:19,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-12-03 16:03:19,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:19,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:19,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:19,478 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:21,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:21,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:21,417 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:21,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 16:03:21,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:21,417 INFO 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:03:21,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:21,427 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:03:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:21,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:03:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:21,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:03:23,277 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:23,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:03:23,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:03:23,296 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:03:23,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:03:23,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:03:23,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:03:23,297 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 16:03:23,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:23,386 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 16:03:23,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:03:23,387 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 16:03:23,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:23,388 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:03:23,388 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:03:23,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:03:23,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:03:23,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:03:23,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:03:23,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 16:03:23,391 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 16:03:23,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:23,391 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 16:03:23,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:03:23,391 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 16:03:23,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:03:23,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:23,391 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 16:03:23,392 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:03:23,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:23,392 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-12-03 16:03:23,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:23,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:23,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:23,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:23,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:03:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:03:24,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:24,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:03:24,159 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:03:24,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:03:24,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:03:24,159 INFO 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:03:24,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:03:24,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:05:27,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:05:27,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:27,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:27,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:29,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:29,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:05:29,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:29,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:05:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:05:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:05:29,665 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 16:05:29,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:29,729 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 16:05:29,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:05:29,729 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 16:05:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:29,730 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:05:29,730 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:05:29,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:05:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:05:29,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:05:29,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:05:29,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 16:05:29,733 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 16:05:29,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:29,734 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 16:05:29,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:05:29,734 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 16:05:29,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 16:05:29,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:29,734 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 16:05:29,735 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:29,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:29,735 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-12-03 16:05:29,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:29,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:29,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:29,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:29,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:30,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:30,494 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:30,494 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:30,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:30,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:30,495 INFO 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:05:30,504 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:05:30,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:05:30,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:05:30,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:05:30,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:30,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:32,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:32,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:05:32,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:32,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:05:32,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:05:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:05:32,468 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 16:05:32,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:32,519 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 16:05:32,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:05:32,520 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 16:05:32,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:32,520 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:05:32,520 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:05:32,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:05:32,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:05:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:05:32,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:05:32,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 16:05:32,524 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 16:05:32,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:32,524 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 16:05:32,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:05:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 16:05:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:05:32,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:32,525 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 16:05:32,525 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:32,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:32,525 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-12-03 16:05:32,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:32,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:32,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:05:32,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:32,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:33,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:33,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:33,378 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:33,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:33,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:33,378 INFO 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:05:33,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:33,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:05:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:33,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:05:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:33,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:05:35,359 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:35,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:05:35,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:05:35,379 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:05:35,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:05:35,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:05:35,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:05:35,380 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 16:05:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:05:35,476 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 16:05:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:05:35,477 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 16:05:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:05:35,477 INFO L225 Difference]: With dead ends: 50 [2018-12-03 16:05:35,477 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:05:35,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:05:35,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:05:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 16:05:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:05:35,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 16:05:35,481 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 16:05:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:05:35,481 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 16:05:35,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:05:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 16:05:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:05:35,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:05:35,482 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 16:05:35,482 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:05:35,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:05:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-12-03 16:05:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:05:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:35,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:05:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:05:35,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:05:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:05:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:05:36,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:36,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:05:36,260 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:05:36,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:05:36,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:05:36,260 INFO 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:05:36,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:05:36,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:07:59,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:07:59,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:00,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:00,225 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:00,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:02,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:02,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 16:08:02,274 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:02,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:08:02,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:08:02,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:08:02,275 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 16:08:02,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:02,325 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 16:08:02,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:08:02,325 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 16:08:02,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:02,326 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:08:02,326 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:08:02,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:08:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:08:02,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:08:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:08:02,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 16:08:02,330 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 16:08:02,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:02,330 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 16:08:02,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:08:02,330 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 16:08:02,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:08:02,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:02,331 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 16:08:02,331 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:02,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:02,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-12-03 16:08:02,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:02,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:08:02,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:02,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:03,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:03,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:03,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:03,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:03,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:03,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:03,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:03,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:08:03,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:08:03,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:08:03,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:08:03,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:03,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:05,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:05,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:08:05,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:05,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:08:05,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:08:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:08:05,320 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 16:08:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:05,597 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 16:08:05,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:08:05,598 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 16:08:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:05,598 INFO L225 Difference]: With dead ends: 52 [2018-12-03 16:08:05,598 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:08:05,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:08:05,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:08:05,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 16:08:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:08:05,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 16:08:05,603 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 16:08:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:05,603 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 16:08:05,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:08:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 16:08:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:08:05,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:05,604 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 16:08:05,604 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:05,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:05,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-12-03 16:08:05,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:05,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:05,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:08:05,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:05,605 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:06,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:06,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:06,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:06,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:06,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:06,574 INFO 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:08:06,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:06,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:08:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:06,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:08:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:06,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:08:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:08,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:08:08,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:08:08,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:08:08,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:08:08,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:08:08,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:08:08,859 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 16:08:08,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:08:08,948 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 16:08:08,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:08:08,948 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 16:08:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:08:08,949 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:08:08,949 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:08:08,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:08:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:08:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:08:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:08:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 16:08:08,952 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 16:08:08,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:08:08,953 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 16:08:08,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:08:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 16:08:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:08:08,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:08:08,953 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 16:08:08,954 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:08:08,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:08:08,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-12-03 16:08:08,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:08:08,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:08,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:08:08,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:08:08,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:08:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:08:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:08:09,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:09,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:08:09,912 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:08:09,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:08:09,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:08:09,913 INFO 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:08:09,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:08:09,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:10:01,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:10:01,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:10:01,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:10:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:10:01,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:10:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:10:03,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:10:03,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:10:03,761 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:10:03,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:10:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:10:03,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:10:03,762 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 16:10:03,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:10:03,839 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 16:10:03,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:10:03,841 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 16:10:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:10:03,841 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:10:03,842 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:10:03,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:10:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:10:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:10:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:10:03,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 16:10:03,847 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 16:10:03,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:10:03,847 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 16:10:03,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:10:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 16:10:03,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:10:03,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:10:03,848 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 16:10:03,848 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:10:03,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:10:03,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-12-03 16:10:03,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:10:03,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:10:03,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:10:03,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:10:03,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:10:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:10:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:10:04,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:10:04,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:10:04,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:10:04,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:10:04,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:10:04,858 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:10:04,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:10:04,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:10:04,903 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:10:04,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:10:04,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:10:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:10:04,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:10:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:10:07,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:10:07,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:10:07,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:10:07,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:10:07,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:10:07,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:10:07,299 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 16:10:07,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:10:07,448 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 16:10:07,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:10:07,448 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 16:10:07,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:10:07,449 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:10:07,449 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:10:07,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:10:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:10:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:10:07,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:10:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 16:10:07,452 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 16:10:07,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:10:07,453 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 16:10:07,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:10:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 16:10:07,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:10:07,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:10:07,453 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 16:10:07,454 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:10:07,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:10:07,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-12-03 16:10:07,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:10:07,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:10:07,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:10:07,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:10:07,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:10:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:10:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:10:08,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:10:08,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:10:08,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:10:08,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:10:08,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:10:08,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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:10:08,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:10:08,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:10:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:10:08,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:10:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:10:08,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:10:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:10:11,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:10:11,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:10:11,256 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:10:11,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:10:11,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:10:11,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:10:11,257 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 16:10:11,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:10:11,333 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 16:10:11,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:10:11,334 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 16:10:11,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:10:11,334 INFO L225 Difference]: With dead ends: 56 [2018-12-03 16:10:11,334 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:10:11,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:10:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:10:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 16:10:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:10:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 16:10:11,338 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 16:10:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:10:11,338 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 16:10:11,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:10:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 16:10:11,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:10:11,338 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:10:11,338 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 16:10:11,338 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:10:11,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:10:11,339 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-12-03 16:10:11,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:10:11,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:10:11,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:10:11,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:10:11,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:10:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:10:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:10:12,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:10:12,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:10:12,490 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:10:12,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:10:12,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:10:12,490 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:10:12,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:10:12,500 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)