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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:07:37,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:07:37,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:07:37,200 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:07:37,201 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:07:37,202 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:07:37,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:07:37,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:07:37,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:07:37,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:07:37,214 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:07:37,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:07:37,215 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:07:37,216 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:07:37,217 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:07:37,218 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:07:37,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:07:37,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:07:37,223 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:07:37,225 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:07:37,226 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:07:37,228 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:07:37,230 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:07:37,230 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:07:37,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:07:37,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:07:37,232 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:07:37,233 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:07:37,234 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:07:37,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:07:37,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:07:37,236 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:07:37,236 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:07:37,236 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:07:37,237 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:07:37,238 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:07:37,239 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:07:37,254 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:07:37,254 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:07:37,255 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:07:37,255 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:07:37,255 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:07:37,255 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:07:37,256 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:07:37,256 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:07:37,256 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:07:37,257 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:07:37,257 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:07:37,257 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:07:37,257 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:07:37,257 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:07:37,257 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:07:37,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:07:37,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:07:37,260 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:07:37,260 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:07:37,260 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:07:37,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:07:37,261 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:07:37,261 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:07:37,261 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:07:37,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:07:37,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:07:37,262 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:07:37,262 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:07:37,263 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:07:37,263 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:07:37,263 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:07:37,263 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:07:37,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:07:37,264 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:07:37,264 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:07:37,264 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:07:37,264 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:07:37,264 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:07:37,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:07:37,265 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:07:37,265 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:07:37,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:07:37,324 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:07:37,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:07:37,329 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:07:37,329 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:07:37,330 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2018-12-03 15:07:37,330 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2018-12-03 15:07:37,363 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:07:37,365 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:07:37,366 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:37,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:07:37,366 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:07:37,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/1) ... [2018-12-03 15:07:37,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/1) ... [2018-12-03 15:07:37,406 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 15:07:37,406 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 15:07:37,407 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 15:07:37,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:07:37,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:07:37,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:07:37,411 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:07:37,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/1) ... [2018-12-03 15:07:37,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/1) ... [2018-12-03 15:07:37,426 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/1) ... [2018-12-03 15:07:37,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/1) ... [2018-12-03 15:07:37,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/1) ... [2018-12-03 15:07:37,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/1) ... [2018-12-03 15:07:37,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/1) ... [2018-12-03 15:07:37,441 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:07:37,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:07:37,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:07:37,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:07:37,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (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:07:37,520 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 15:07:37,520 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 15:07:37,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 15:07:37,699 INFO L272 CfgBuilder]: Using library mode [2018-12-03 15:07:37,699 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:07:37,700 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:37 BoogieIcfgContainer [2018-12-03 15:07:37,700 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:07:37,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:07:37,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:07:37,704 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:07:37,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:07:37" (1/2) ... [2018-12-03 15:07:37,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65053303 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:07:37, skipping insertion in model container [2018-12-03 15:07:37,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:07:37" (2/2) ... [2018-12-03 15:07:37,708 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2018-12-03 15:07:37,719 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:07:37,727 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:07:37,745 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:07:37,782 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:07:37,782 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:07:37,782 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:07:37,783 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:07:37,783 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:07:37,783 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:07:37,783 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:07:37,783 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:07:37,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:07:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:07:37,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:37,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:07:37,811 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:37,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:37,818 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-12-03 15:07:37,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:37,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:37,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:37,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:37,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:38,384 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2018-12-03 15:07:38,458 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:07:38,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:07:38,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:07:38,463 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:07:38,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:07:38,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:07:38,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:38,484 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2018-12-03 15:07:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:38,598 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:07:38,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:07:38,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-03 15:07:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:38,612 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:07:38,613 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:07:38,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:07:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:07:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-12-03 15:07:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:07:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:07:38,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-12-03 15:07:38,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:38,654 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:07:38,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:07:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:07:38,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:07:38,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:38,655 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:07:38,655 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:38,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:38,656 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-12-03 15:07:38,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:38,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:38,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:38,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:38,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:39,185 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-12-03 15:07:39,323 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2018-12-03 15:07:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:39,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:39,382 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:39,383 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 15:07:39,384 INFO L205 CegarAbsIntRunner]: [0], [4], [5], [6] [2018-12-03 15:07:39,421 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:07:39,421 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:07:40,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:07:40,156 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 3 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:07:40,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:40,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:07:40,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:40,202 INFO 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:07:40,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:40,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:40,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:40,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:40,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:40,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:40,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:40,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:40,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:40,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:40,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:40,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:40,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:40,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:40,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2018-12-03 15:07:40,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:40,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:07:40,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:07:40,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:07:40,871 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2018-12-03 15:07:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:40,938 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:07:40,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:07:40,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2018-12-03 15:07:40,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:40,940 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:07:40,941 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:07:40,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:07:40,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:07:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-12-03 15:07:40,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:07:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:07:40,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-03 15:07:40,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:40,945 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:07:40,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:07:40,946 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:07:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:07:40,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:40,946 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-12-03 15:07:40,947 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:40,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:40,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-12-03 15:07:40,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:40,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:40,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:40,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:40,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:41,397 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2018-12-03 15:07:41,418 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:07:41,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:41,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:41,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:41,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:07:41,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:41,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 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:07:41,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:07:41,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:07:41,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:07:41,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:07:41,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:41,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:41,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:41,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:41,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:41,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:41,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:41,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:41,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:41,655 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:07:41,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:41,809 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:07:41,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:41,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2018-12-03 15:07:41,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:41,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:07:41,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:07:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:07:41,831 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2018-12-03 15:07:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:41,907 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:07:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:07:41,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2018-12-03 15:07:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:41,914 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:07:41,914 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:07:41,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:07:41,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:07:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-03 15:07:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:07:41,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:07:41,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-03 15:07:41,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:41,918 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:07:41,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:07:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:07:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:07:41,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:41,919 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-12-03 15:07:41,919 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:41,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-12-03 15:07:41,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:41,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:41,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:42,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:42,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:42,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:42,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:07:42,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:42,221 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:07:42,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:07:42,244 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:07:42,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:07:42,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:42,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:42,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:42,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:42,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:42,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:42,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:42,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:42,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:42,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:42,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:42,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:42,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2018-12-03 15:07:42,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:42,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:07:42,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:07:42,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:07:42,636 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2018-12-03 15:07:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:42,782 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:07:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:07:42,784 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2018-12-03 15:07:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:42,785 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:07:42,785 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:07:42,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:07:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:07:42,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-12-03 15:07:42,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:07:42,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:07:42,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-03 15:07:42,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:42,789 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:07:42,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:07:42,789 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:07:42,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:07:42,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:42,790 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-12-03 15:07:42,790 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:42,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:42,791 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-12-03 15:07:42,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:42,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:42,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:42,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:42,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:42,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:43,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:43,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:43,239 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:43,239 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:07:43,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:43,240 INFO 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:07:43,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:43,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:43,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:43,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:43,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:43,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:43,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:43,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:43,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:43,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:43,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:43,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:43,727 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:43,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:43,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2018-12-03 15:07:43,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:43,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:07:43,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:07:43,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:07:43,749 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2018-12-03 15:07:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:43,869 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 15:07:43,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:07:43,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2018-12-03 15:07:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:43,871 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:07:43,871 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:07:43,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:07:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:07:43,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-03 15:07:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:07:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:07:43,875 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-03 15:07:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:43,875 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:07:43,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:07:43,876 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:07:43,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:07:43,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:43,876 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-12-03 15:07:43,877 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:43,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-12-03 15:07:43,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:43,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:43,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:43,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:43,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:44,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:44,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:44,193 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:44,193 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:07:44,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:44,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07:44,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:07:44,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:07:44,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:07:44,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:07:44,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:44,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:44,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:44,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:44,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:44,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:44,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:44,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:44,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:44,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:44,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:44,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2018-12-03 15:07:44,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:44,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:07:44,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:07:44,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:07:44,720 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2018-12-03 15:07:44,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:44,968 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 15:07:44,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:07:44,968 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2018-12-03 15:07:44,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:44,969 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:07:44,969 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:07:44,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:07:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:07:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-03 15:07:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:07:44,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:07:44,974 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-03 15:07:44,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:44,974 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:07:44,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:07:44,974 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:07:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:07:44,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:44,975 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-12-03 15:07:44,975 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:44,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-12-03 15:07:44,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:44,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:44,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:45,313 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:07:45,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:45,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:45,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:45,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:45,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:07:45,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:45,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 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:07:45,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:07:45,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:07:45,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:07:45,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:07:45,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:45,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:45,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:45,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:45,692 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:45,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:45,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:45,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:45,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:45,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:46,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:46,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2018-12-03 15:07:46,391 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:46,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:07:46,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:07:46,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:07:46,393 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2018-12-03 15:07:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:46,629 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 15:07:46,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:07:46,630 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2018-12-03 15:07:46,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:46,631 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:07:46,631 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:07:46,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:07:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:07:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-03 15:07:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:07:46,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:07:46,636 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-03 15:07:46,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:46,637 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:07:46,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:07:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:07:46,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:07:46,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:46,638 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-12-03 15:07:46,638 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:46,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:46,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-12-03 15:07:46,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:46,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:46,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:46,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:47,004 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:47,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:47,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:47,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:47,005 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:07:47,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:47,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07:47,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:47,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:47,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:47,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:47,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:47,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:47,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:47,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:47,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:47,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:47,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:47,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:47,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:47,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2018-12-03 15:07:47,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:47,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:07:47,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:07:47,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:07:47,669 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2018-12-03 15:07:48,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:48,073 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 15:07:48,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:07:48,074 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2018-12-03 15:07:48,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:48,075 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:07:48,075 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:07:48,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:07:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:07:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-12-03 15:07:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:07:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:07:48,085 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-03 15:07:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:48,085 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:07:48,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:07:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:07:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:07:48,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:48,088 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-12-03 15:07:48,088 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:48,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-12-03 15:07:48,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:48,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:48,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:48,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:48,499 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-12-03 15:07:48,576 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:48,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:48,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:48,577 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:48,577 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:07:48,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:48,577 INFO 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:07:48,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:07:48,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:07:48,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 15:07:48,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:07:48,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:48,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:48,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:48,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:48,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:48,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:48,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:48,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:48,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:48,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:49,340 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:49,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:49,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2018-12-03 15:07:49,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:49,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:07:49,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:07:49,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:07:49,362 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2018-12-03 15:07:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:49,766 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 15:07:49,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:07:49,767 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2018-12-03 15:07:49,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:49,768 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:07:49,768 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:07:49,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:07:49,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:07:49,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-03 15:07:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:07:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:07:49,773 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-12-03 15:07:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:49,773 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:07:49,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:07:49,773 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:07:49,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:07:49,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:49,774 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-12-03 15:07:49,774 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:49,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:49,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-12-03 15:07:49,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:49,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:49,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:49,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:49,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:50,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:50,330 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:50,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:50,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:07:50,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:50,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 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:07:50,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:07:50,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:07:50,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:07:50,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:07:50,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:50,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:50,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:50,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:50,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:50,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:50,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:50,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:50,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:50,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:51,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:51,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2018-12-03 15:07:51,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:51,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:07:51,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:07:51,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:07:51,024 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2018-12-03 15:07:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:51,277 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 15:07:51,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:07:51,277 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2018-12-03 15:07:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:51,278 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:07:51,278 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:07:51,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:07:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:07:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-03 15:07:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:07:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:07:51,284 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-12-03 15:07:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:51,284 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:07:51,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:07:51,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:07:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:07:51,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:51,285 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-12-03 15:07:51,285 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:51,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-12-03 15:07:51,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:51,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:51,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:51,738 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:51,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:51,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:51,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:51,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:07:51,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:51,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07:51,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:51,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:51,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:51,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:51,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:51,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:51,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:52,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:52,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:52,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:52,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:52,127 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:52,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:52,701 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:52,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:52,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2018-12-03 15:07:52,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:52,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:07:52,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:07:52,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:07:52,724 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2018-12-03 15:07:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:53,017 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 15:07:53,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:07:53,018 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2018-12-03 15:07:53,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:53,019 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:07:53,019 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:07:53,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:07:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:07:53,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-03 15:07:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:07:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:07:53,025 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-12-03 15:07:53,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:53,026 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:07:53,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:07:53,026 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:07:53,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:07:53,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:53,027 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-12-03 15:07:53,027 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:53,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:53,028 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-12-03 15:07:53,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:53,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:53,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:53,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:53,425 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:07:53,938 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:53,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:53,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:53,938 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:53,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:07:53,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:53,938 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07:53,948 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:07:53,948 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:07:53,966 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 15:07:53,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:07:53,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:53,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:53,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:53,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:53,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:54,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:54,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:54,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:54,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:54,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:54,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:54,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2018-12-03 15:07:54,902 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:54,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:07:54,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:07:54,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:07:54,904 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2018-12-03 15:07:55,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:55,412 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 15:07:55,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:07:55,413 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2018-12-03 15:07:55,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:55,414 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:07:55,414 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:07:55,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:07:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:07:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-03 15:07:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:07:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:07:55,420 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-12-03 15:07:55,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:55,420 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:07:55,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:07:55,420 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:07:55,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:07:55,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:55,421 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-12-03 15:07:55,421 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:55,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:55,422 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-12-03 15:07:55,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:55,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:55,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:55,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:55,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:56,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:56,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:56,045 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:56,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:07:56,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:56,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:07:56,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:07:56,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:07:56,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:07:56,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:07:56,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:56,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:56,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:56,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:56,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:56,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:56,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:56,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:56,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:56,438 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:56,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:57,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:57,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2018-12-03 15:07:57,002 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:57,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:07:57,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:07:57,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:07:57,004 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2018-12-03 15:07:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:07:57,558 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 15:07:57,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:07:57,559 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2018-12-03 15:07:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:07:57,559 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:07:57,560 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:07:57,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:07:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:07:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-03 15:07:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:07:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:07:57,565 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-12-03 15:07:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:07:57,566 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:07:57,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:07:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:07:57,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:07:57,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:07:57,567 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-12-03 15:07:57,567 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:07:57,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:07:57,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-12-03 15:07:57,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:07:57,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:57,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:07:57,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:07:57,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:07:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:57,828 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:07:58,093 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:07:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:58,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:58,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:07:58,577 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:07:58,577 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:07:58,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:07:58,577 INFO 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:07:58,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:07:58,586 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:07:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:07:58,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:07:58,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:07:58,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:58,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:58,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:07:59,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:07:59,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:07:59,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:07:59,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:07:59,064 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:59,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:07:59,717 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:07:59,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:07:59,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2018-12-03 15:07:59,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:07:59,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:07:59,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:07:59,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:07:59,739 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2018-12-03 15:08:00,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:00,584 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 15:08:00,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:08:00,584 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2018-12-03 15:08:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:00,585 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:08:00,586 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:08:00,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:08:00,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:08:00,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-12-03 15:08:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:08:00,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:08:00,592 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-12-03 15:08:00,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:00,593 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:08:00,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:08:00,593 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:08:00,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:08:00,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:00,594 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-12-03 15:08:00,594 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:00,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:00,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-12-03 15:08:00,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:00,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:00,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:00,858 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:08:01,745 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-12-03 15:08:01,750 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:08:01,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:01,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:01,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:01,750 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:08:01,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:01,750 INFO 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:08:01,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:08:01,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:08:01,781 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 15:08:01,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:01,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:01,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:01,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:01,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:01,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:02,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:02,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:02,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:02,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:02,219 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:08:02,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:03,346 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:08:03,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:03,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2018-12-03 15:08:03,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:03,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:08:03,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:08:03,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:08:03,368 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2018-12-03 15:08:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:03,989 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 15:08:03,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:08:03,990 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2018-12-03 15:08:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:03,991 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:08:03,991 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:08:03,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:08:03,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:08:03,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-03 15:08:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:08:03,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 15:08:03,997 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-12-03 15:08:03,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:03,998 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 15:08:03,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:08:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 15:08:03,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:08:03,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:03,999 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-12-03 15:08:03,999 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:03,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:03,999 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-12-03 15:08:03,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:04,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:04,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:04,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:04,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:04,235 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:08:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:04,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:04,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:04,759 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:04,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:04,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:04,760 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:04,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:08:04,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:08:04,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:08:04,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:04,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:04,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:04,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:04,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:04,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:05,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:05,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:05,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:05,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:05,640 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:05,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:07,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:07,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2018-12-03 15:08:07,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:07,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:08:07,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:08:07,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:08:07,617 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2018-12-03 15:08:08,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:08,088 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 15:08:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:08:08,089 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2018-12-03 15:08:08,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:08,089 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:08:08,090 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:08:08,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:08:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:08:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-12-03 15:08:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:08:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 15:08:08,096 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-12-03 15:08:08,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:08,097 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 15:08:08,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:08:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 15:08:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:08:08,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:08,098 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-12-03 15:08:08,098 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:08,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:08,098 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-12-03 15:08:08,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:08,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:08,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:08,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:08,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:08,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:08,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:08,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:08,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:08,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:08,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 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:08:08,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:08,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:08,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:08,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:08,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:08,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:08,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:09,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:09,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:09,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:09,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:09,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:10,104 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:10,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:10,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2018-12-03 15:08:10,123 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:10,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:08:10,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:08:10,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:08:10,125 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2018-12-03 15:08:11,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:11,199 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 15:08:11,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:08:11,199 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2018-12-03 15:08:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:11,200 INFO L225 Difference]: With dead ends: 40 [2018-12-03 15:08:11,200 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:08:11,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:08:11,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:08:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-12-03 15:08:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:08:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 15:08:11,208 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-03 15:08:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:11,208 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 15:08:11,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:08:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 15:08:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:08:11,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:11,209 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-12-03 15:08:11,209 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:11,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:11,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-12-03 15:08:11,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:11,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:11,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:11,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:11,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:11,473 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:08:11,713 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:08:11,978 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:08:12,663 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:12,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:12,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:12,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:12,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:12,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:12,664 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:12,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:08:12,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:08:12,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:08:12,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:12,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:12,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:12,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:12,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:12,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:13,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:13,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:13,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:13,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:13,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:14,383 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:14,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:14,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2018-12-03 15:08:14,402 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:14,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:08:14,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:08:14,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:08:14,403 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2018-12-03 15:08:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:15,210 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 15:08:15,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:08:15,211 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2018-12-03 15:08:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:15,212 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:08:15,212 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:08:15,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:08:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:08:15,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-03 15:08:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:08:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 15:08:15,218 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-03 15:08:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:15,219 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 15:08:15,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:08:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 15:08:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:08:15,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:15,220 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-12-03 15:08:15,220 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:15,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-12-03 15:08:15,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:15,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:15,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:15,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:15,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:16,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:16,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:16,133 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:16,133 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:08:16,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:16,133 INFO 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:08:16,143 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:08:16,143 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:08:16,170 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:08:16,170 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:16,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:16,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:16,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:16,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:16,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:16,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:16,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:16,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:16,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:16,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:17,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:17,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2018-12-03 15:08:17,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:17,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:08:17,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:08:17,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:08:17,971 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2018-12-03 15:08:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:18,926 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 15:08:18,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:08:18,926 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2018-12-03 15:08:18,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:18,927 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:08:18,927 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:08:18,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:08:18,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:08:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-03 15:08:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:08:18,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 15:08:18,933 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-03 15:08:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:18,933 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 15:08:18,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:08:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 15:08:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:08:18,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:18,934 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-12-03 15:08:18,934 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:18,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:18,935 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-12-03 15:08:18,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:18,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:18,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:18,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:18,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:19,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:19,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:19,858 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:19,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 15:08:19,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:19,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 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:08:19,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:19,867 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:19,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:19,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:19,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:19,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:19,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:20,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:20,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:20,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:20,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:20,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:22,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:22,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2018-12-03 15:08:22,020 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:22,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:08:22,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:08:22,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:08:22,021 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2018-12-03 15:08:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:22,858 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 15:08:22,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:08:22,858 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2018-12-03 15:08:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:22,859 INFO L225 Difference]: With dead ends: 46 [2018-12-03 15:08:22,859 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:08:22,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 15:08:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:08:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-12-03 15:08:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:08:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 15:08:22,867 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-03 15:08:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:22,867 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 15:08:22,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:08:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 15:08:22,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:08:22,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:22,869 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-12-03 15:08:22,869 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:22,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-12-03 15:08:22,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:22,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:22,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:22,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:22,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:23,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:23,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:23,578 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:23,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:23,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:23,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:23,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:08:23,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:08:23,610 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 15:08:23,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:23,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:23,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:23,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:23,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:23,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:24,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:24,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:24,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:24,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:24,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:25,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:25,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2018-12-03 15:08:25,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:25,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:08:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:08:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:08:25,769 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2018-12-03 15:08:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:26,727 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 15:08:26,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:08:26,728 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2018-12-03 15:08:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:26,728 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:08:26,728 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:08:26,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:08:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:08:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-03 15:08:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:08:26,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 15:08:26,735 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-12-03 15:08:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:26,735 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 15:08:26,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:08:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 15:08:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:08:26,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:26,736 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-12-03 15:08:26,736 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:26,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:26,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-12-03 15:08:26,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:26,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:26,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:26,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:26,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:26,933 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:08:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:27,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:27,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:27,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:27,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 15:08:27,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:27,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 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:08:27,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:08:27,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:08:27,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:08:27,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:27,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:27,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:27,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:27,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:27,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:28,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:28,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:28,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:28,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:28,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:29,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:29,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2018-12-03 15:08:29,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:29,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:08:29,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:08:29,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:08:29,979 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2018-12-03 15:08:31,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:31,234 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 15:08:31,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:08:31,238 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2018-12-03 15:08:31,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:31,238 INFO L225 Difference]: With dead ends: 50 [2018-12-03 15:08:31,238 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:08:31,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 15:08:31,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:08:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-12-03 15:08:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:08:31,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 15:08:31,243 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-12-03 15:08:31,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:31,244 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 15:08:31,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:08:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 15:08:31,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:08:31,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:31,245 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-12-03 15:08:31,245 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:31,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:31,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-12-03 15:08:31,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:31,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:31,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:31,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:31,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:31,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:31,513 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:08:31,708 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:08:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:32,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:32,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:32,392 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:32,392 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:08:32,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:32,392 INFO 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:08:32,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:32,402 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:32,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:32,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:32,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:32,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:32,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:33,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:33,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:33,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:33,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:33,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:34,751 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:34,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:34,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2018-12-03 15:08:34,770 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:34,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:08:34,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:08:34,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:08:34,772 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2018-12-03 15:08:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:35,947 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 15:08:35,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:08:35,947 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2018-12-03 15:08:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:35,947 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:08:35,947 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:08:35,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:08:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:08:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-03 15:08:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:08:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 15:08:35,953 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-12-03 15:08:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:35,953 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 15:08:35,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:08:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 15:08:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:08:35,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:35,954 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-12-03 15:08:35,954 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:35,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:35,955 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-12-03 15:08:35,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:35,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:35,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:35,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:35,956 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:36,219 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:08:36,413 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 15:08:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:37,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:37,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:37,109 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:37,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:37,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:37,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:37,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:08:37,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:08:37,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:08:37,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:37,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:37,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:37,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:37,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:37,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:38,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:38,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:38,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:38,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:38,111 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:38,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:39,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:39,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2018-12-03 15:08:39,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:39,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:08:39,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:08:39,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:08:39,658 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2018-12-03 15:08:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:41,182 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 15:08:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:08:41,183 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2018-12-03 15:08:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:41,184 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:08:41,184 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:08:41,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 15:08:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:08:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-12-03 15:08:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:08:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 15:08:41,190 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-12-03 15:08:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:41,191 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 15:08:41,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:08:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 15:08:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:08:41,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:41,191 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-12-03 15:08:41,192 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:41,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:41,192 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-12-03 15:08:41,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:41,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:41,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:41,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:41,193 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:42,187 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:42,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:42,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:42,187 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:42,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:42,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:42,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:42,197 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:08:42,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:08:42,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:08:42,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:42,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:42,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:42,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:42,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:42,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:43,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:43,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:43,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:43,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:43,260 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:43,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:44,953 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:44,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:44,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2018-12-03 15:08:44,972 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:44,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:08:44,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:08:44,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:08:44,973 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2018-12-03 15:08:46,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:46,245 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 15:08:46,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:08:46,245 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2018-12-03 15:08:46,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:46,246 INFO L225 Difference]: With dead ends: 56 [2018-12-03 15:08:46,246 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:08:46,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:08:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:08:46,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-12-03 15:08:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:08:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 15:08:46,251 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-12-03 15:08:46,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:46,251 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 15:08:46,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:08:46,251 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 15:08:46,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:08:46,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:46,252 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-12-03 15:08:46,252 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:46,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:46,253 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-12-03 15:08:46,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:46,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:46,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:46,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:46,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:47,224 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:47,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:47,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:47,224 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:47,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:47,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:47,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:47,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:47,236 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:08:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:47,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:47,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:47,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:47,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:47,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:48,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:48,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:48,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:48,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:48,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:50,545 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:50,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:50,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2018-12-03 15:08:50,564 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:50,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:08:50,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:08:50,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:08:50,566 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2018-12-03 15:08:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:51,985 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 15:08:51,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:08:51,986 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2018-12-03 15:08:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:51,986 INFO L225 Difference]: With dead ends: 58 [2018-12-03 15:08:51,986 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:08:51,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:08:51,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:08:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-12-03 15:08:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:08:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 15:08:51,992 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-12-03 15:08:51,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:51,992 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 15:08:51,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:08:51,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 15:08:51,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:08:51,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:51,993 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-12-03 15:08:51,994 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:51,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-12-03 15:08:51,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:51,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:08:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:51,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:52,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:53,121 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:53,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:53,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:08:53,122 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:08:53,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:08:53,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:08:53,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:08:53,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:08:53,131 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:08:53,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 15:08:53,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:08:53,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:08:53,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:08:53,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:53,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:53,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:08:54,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:08:54,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:08:54,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:08:54,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:08:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:54,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:08:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:08:56,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:08:56,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2018-12-03 15:08:56,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:08:56,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:08:56,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:08:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:08:56,316 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2018-12-03 15:08:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:08:58,321 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 15:08:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:08:58,322 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2018-12-03 15:08:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:08:58,323 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:08:58,323 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:08:58,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:08:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:08:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-03 15:08:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:08:58,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 15:08:58,327 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-12-03 15:08:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:08:58,327 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 15:08:58,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:08:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 15:08:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:08:58,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:08:58,328 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-12-03 15:08:58,328 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:08:58,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:08:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-12-03 15:08:58,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:08:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:58,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:08:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:08:58,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:08:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:08:58,606 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:08:58,840 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:08:59,104 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:08:59,412 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:08:59,763 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:09:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:00,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:00,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:00,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:00,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:00,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:00,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:09:00,884 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:09:00,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:09:00,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:09:00,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:09:00,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:00,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:09:00,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:00,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:00,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:09:02,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:09:02,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:02,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:02,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:09:02,386 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:02,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:04,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:04,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2018-12-03 15:09:04,426 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:04,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:09:04,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:09:04,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:09:04,427 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2018-12-03 15:09:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:05,866 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 15:09:05,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:09:05,867 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2018-12-03 15:09:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:05,867 INFO L225 Difference]: With dead ends: 62 [2018-12-03 15:09:05,867 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:09:05,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 15:09:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:09:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-12-03 15:09:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:09:05,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 15:09:05,873 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-12-03 15:09:05,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:05,873 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 15:09:05,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:09:05,873 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 15:09:05,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:09:05,874 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:05,874 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-12-03 15:09:05,874 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:05,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:05,875 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-12-03 15:09:05,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:05,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:05,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:09:05,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:05,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:07,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:07,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:07,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:07,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:07,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:07,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:09:07,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:07,299 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:07,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:07,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:09:07,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:07,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:07,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:09:08,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:09:08,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:08,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:08,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:09:08,644 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:08,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:10,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2018-12-03 15:09:10,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:10,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:09:10,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:09:10,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:09:10,871 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2018-12-03 15:09:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:12,514 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 15:09:12,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:09:12,514 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2018-12-03 15:09:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:12,515 INFO L225 Difference]: With dead ends: 64 [2018-12-03 15:09:12,515 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:09:12,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:09:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:09:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-12-03 15:09:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:09:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 15:09:12,520 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-12-03 15:09:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:12,520 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 15:09:12,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:09:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 15:09:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 15:09:12,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:12,521 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-12-03 15:09:12,521 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:12,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-12-03 15:09:12,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:12,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:12,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:12,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:12,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:13,652 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:13,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:13,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:13,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:13,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:13,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:13,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:09:13,660 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:09:13,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:09:13,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 15:09:13,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:09:13,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:13,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:09:13,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:13,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:13,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:09:15,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:09:15,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:15,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:15,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:09:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:15,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:17,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:17,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2018-12-03 15:09:17,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:17,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:09:17,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:09:17,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:09:17,663 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2018-12-03 15:09:19,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:19,502 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 15:09:19,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:09:19,502 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2018-12-03 15:09:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:19,503 INFO L225 Difference]: With dead ends: 66 [2018-12-03 15:09:19,504 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:09:19,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 15:09:19,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:09:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-03 15:09:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:09:19,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 15:09:19,509 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-12-03 15:09:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:19,509 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 15:09:19,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:09:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 15:09:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:09:19,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:19,509 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-12-03 15:09:19,510 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:19,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:19,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-12-03 15:09:19,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:19,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:09:19,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:19,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:20,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:20,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:20,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:20,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:20,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:20,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:09:20,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:09:20,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:09:20,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:09:20,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:09:20,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:20,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:09:20,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:20,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:20,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:09:22,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:09:22,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:22,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:22,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:09:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:22,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:25,015 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:25,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:25,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2018-12-03 15:09:25,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:25,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:09:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:09:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:09:25,035 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2018-12-03 15:09:26,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:26,667 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 15:09:26,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:09:26,668 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2018-12-03 15:09:26,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:26,668 INFO L225 Difference]: With dead ends: 68 [2018-12-03 15:09:26,669 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:09:26,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:09:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:09:26,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-03 15:09:26,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:09:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 15:09:26,674 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-12-03 15:09:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:26,674 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 15:09:26,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:09:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 15:09:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:09:26,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:26,675 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-12-03 15:09:26,676 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:26,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-12-03 15:09:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:26,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:09:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:26,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:28,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:28,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:28,155 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:28,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:09:28,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:28,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 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:09:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:28,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:28,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:28,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:09:28,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:28,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:28,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:09:29,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:09:29,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:29,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:29,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:09:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:29,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:32,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:32,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2018-12-03 15:09:32,780 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:32,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:09:32,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:09:32,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:09:32,782 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2018-12-03 15:09:34,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:34,697 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 15:09:34,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:09:34,697 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2018-12-03 15:09:34,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:34,698 INFO L225 Difference]: With dead ends: 70 [2018-12-03 15:09:34,698 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 15:09:34,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 15:09:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 15:09:34,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-12-03 15:09:34,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:09:34,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 15:09:34,703 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-12-03 15:09:34,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:34,703 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 15:09:34,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:09:34,704 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 15:09:34,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:09:34,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:34,704 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-12-03 15:09:34,704 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:34,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:34,705 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-12-03 15:09:34,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:34,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:34,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:34,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:34,913 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:09:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:36,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:36,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:36,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:36,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:36,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:36,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:09:36,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:09:36,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:09:36,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 15:09:36,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:09:36,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:36,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:09:36,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:36,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:36,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:09:37,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:09:37,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:38,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:38,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:09:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:38,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:40,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:40,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2018-12-03 15:09:40,863 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:40,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:09:40,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:09:40,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:09:40,864 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2018-12-03 15:09:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:43,686 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 15:09:43,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:09:43,687 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2018-12-03 15:09:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:43,688 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:09:43,688 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 15:09:43,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:09:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 15:09:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-12-03 15:09:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:09:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 15:09:43,693 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-12-03 15:09:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:43,693 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 15:09:43,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:09:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 15:09:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:09:43,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:43,694 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-12-03 15:09:43,694 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:43,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:43,694 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-12-03 15:09:43,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:43,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:09:43,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:43,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:43,954 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:09:44,175 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:09:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:45,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:45,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:45,351 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:45,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:45,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:45,351 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:45,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:09:45,360 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:09:45,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:09:45,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:09:45,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:45,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:09:45,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:45,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:45,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:09:47,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:09:47,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:47,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:47,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:09:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:47,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:50,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:50,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2018-12-03 15:09:50,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:50,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:09:50,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:09:50,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 15:09:50,316 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2018-12-03 15:09:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:09:52,537 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 15:09:52,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:09:52,538 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2018-12-03 15:09:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:09:52,539 INFO L225 Difference]: With dead ends: 74 [2018-12-03 15:09:52,539 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:09:52,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 15:09:52,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:09:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-12-03 15:09:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:09:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 15:09:52,544 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-12-03 15:09:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:09:52,544 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 15:09:52,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:09:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 15:09:52,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:09:52,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:09:52,545 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-12-03 15:09:52,545 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:09:52,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:09:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-12-03 15:09:52,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:09:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:52,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:09:52,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:09:52,546 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:09:52,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:52,745 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:09:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:53,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:53,973 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:09:53,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:09:53,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:09:53,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:09:53,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:09:53,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:09:53,982 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:09:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:09:54,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:09:54,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:09:54,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:54,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:54,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:09:55,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:09:55,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:09:55,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:09:55,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:09:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:55,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:09:59,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:09:59,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:09:59,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2018-12-03 15:09:59,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:09:59,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:09:59,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:09:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:09:59,259 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2018-12-03 15:10:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:01,630 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 15:10:01,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:10:01,631 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2018-12-03 15:10:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:01,631 INFO L225 Difference]: With dead ends: 76 [2018-12-03 15:10:01,632 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:10:01,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:10:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:10:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-03 15:10:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:10:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 15:10:01,637 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-12-03 15:10:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:01,638 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 15:10:01,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:10:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 15:10:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:10:01,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:01,639 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-12-03 15:10:01,639 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:01,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:01,639 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-12-03 15:10:01,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:01,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:01,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:01,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:01,912 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:10:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:03,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:03,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:03,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:10:03,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:10:03,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:03,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:03,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:10:03,599 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:10:03,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 15:10:03,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:10:03,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:03,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:10:03,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:03,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:03,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:10:05,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:10:05,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:05,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:05,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:10:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:05,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:09,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:09,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2018-12-03 15:10:09,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:09,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:10:09,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:10:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 15:10:09,365 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2018-12-03 15:10:12,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:12,270 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 15:10:12,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:10:12,271 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2018-12-03 15:10:12,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:12,272 INFO L225 Difference]: With dead ends: 78 [2018-12-03 15:10:12,272 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 15:10:12,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 15:10:12,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 15:10:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-03 15:10:12,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:10:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 15:10:12,277 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-12-03 15:10:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:12,277 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 15:10:12,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:10:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 15:10:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:10:12,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:12,278 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-12-03 15:10:12,278 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:12,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:12,278 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-12-03 15:10:12,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:12,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:10:12,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:12,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:12,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:12,521 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:10:14,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:14,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:14,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:14,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:10:14,201 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:10:14,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:14,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:14,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:10:14,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:10:14,233 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:10:14,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:10:14,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:14,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:10:14,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:14,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:14,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:10:16,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:10:16,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:16,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:16,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:10:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:16,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:20,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:20,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2018-12-03 15:10:20,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:20,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:10:20,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:10:20,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:10:20,028 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2018-12-03 15:10:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:22,848 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 15:10:22,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:10:22,851 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2018-12-03 15:10:22,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:22,852 INFO L225 Difference]: With dead ends: 80 [2018-12-03 15:10:22,852 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:10:22,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:10:22,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:10:22,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-12-03 15:10:22,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:10:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 15:10:22,855 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-12-03 15:10:22,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:22,855 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 15:10:22,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:10:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 15:10:22,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 15:10:22,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:22,856 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-12-03 15:10:22,856 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:22,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:22,857 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-12-03 15:10:22,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:22,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:10:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:22,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:23,045 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:10:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:24,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:24,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:24,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:10:24,711 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:10:24,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:24,711 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:24,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:24,719 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:24,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:24,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:24,764 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:10:24,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:24,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:24,798 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:10:26,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:10:26,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:26,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:26,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:10:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:26,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:30,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:30,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2018-12-03 15:10:30,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:30,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 15:10:30,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 15:10:30,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 15:10:30,795 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2018-12-03 15:10:33,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:33,472 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 15:10:33,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:10:33,473 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2018-12-03 15:10:33,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:33,474 INFO L225 Difference]: With dead ends: 82 [2018-12-03 15:10:33,474 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 15:10:33,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 15:10:33,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 15:10:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-12-03 15:10:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:10:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 15:10:33,479 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-12-03 15:10:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:33,479 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 15:10:33,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 15:10:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 15:10:33,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 15:10:33,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:33,480 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-12-03 15:10:33,480 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:33,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:33,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-12-03 15:10:33,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:33,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:33,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:33,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:33,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:33,708 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:10:35,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:35,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:35,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:35,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:10:35,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:10:35,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:35,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:35,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:10:35,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:10:35,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 15:10:35,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:10:35,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:35,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:10:35,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:35,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:35,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:10:37,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:10:37,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:37,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:37,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:10:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:37,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:41,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:41,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2018-12-03 15:10:41,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:41,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 15:10:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 15:10:41,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:10:41,792 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2018-12-03 15:10:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:45,400 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 15:10:45,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:10:45,400 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2018-12-03 15:10:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:45,401 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:10:45,401 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:10:45,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:10:45,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:10:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-12-03 15:10:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:10:45,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 15:10:45,406 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-12-03 15:10:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:45,406 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 15:10:45,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 15:10:45,406 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 15:10:45,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:10:45,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:45,406 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-12-03 15:10:45,406 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:45,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:45,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-12-03 15:10:45,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:45,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:45,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:10:45,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:45,408 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:45,656 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:10:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:47,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:47,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:47,322 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:10:47,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:10:47,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:47,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:47,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:10:47,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:10:47,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:10:47,356 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:10:47,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:47,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:10:47,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:47,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:47,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:10:49,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:10:49,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:49,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:49,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:10:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:49,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:10:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:53,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:10:53,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2018-12-03 15:10:53,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:10:53,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:10:53,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:10:53,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 15:10:53,981 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2018-12-03 15:10:56,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:10:56,961 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 15:10:56,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:10:56,961 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2018-12-03 15:10:56,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:10:56,962 INFO L225 Difference]: With dead ends: 86 [2018-12-03 15:10:56,963 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:10:56,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 15:10:56,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:10:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-12-03 15:10:56,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:10:56,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 15:10:56,969 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-12-03 15:10:56,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:10:56,969 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 15:10:56,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:10:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 15:10:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:10:56,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:10:56,970 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-12-03 15:10:56,970 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:10:56,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:10:56,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-12-03 15:10:56,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:10:56,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:56,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:10:56,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:10:56,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:10:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:57,186 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:10:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:10:58,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:58,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:10:58,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:10:58,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:10:58,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:10:58,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:10:58,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:10:58,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:10:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:10:58,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:10:58,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:10:58,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:10:58,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:10:58,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:11:01,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:11:01,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:11:01,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:11:01,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:11:01,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:01,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:05,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:05,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:05,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2018-12-03 15:11:05,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:05,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 15:11:05,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 15:11:05,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:11:05,999 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2018-12-03 15:11:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:10,011 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 15:11:10,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:11:10,012 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2018-12-03 15:11:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:10,013 INFO L225 Difference]: With dead ends: 88 [2018-12-03 15:11:10,013 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 15:11:10,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:11:10,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 15:11:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-12-03 15:11:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 15:11:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 15:11:10,019 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-12-03 15:11:10,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:10,020 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 15:11:10,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 15:11:10,020 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 15:11:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 15:11:10,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:10,021 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-12-03 15:11:10,021 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:10,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:10,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-12-03 15:11:10,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:10,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:10,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:10,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:11,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:11,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:11,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:11,783 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:11:11,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:11:11,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:11,783 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:11,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:11:11,791 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:11:11,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 15:11:11,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:11:11,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:11,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:11:11,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:11:11,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:11:11,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:11:14,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:11:14,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:11:14,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:11:14,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:11:14,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:14,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:19,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:19,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2018-12-03 15:11:19,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:19,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 15:11:19,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 15:11:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 15:11:19,211 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2018-12-03 15:11:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:23,793 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 15:11:23,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:11:23,794 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2018-12-03 15:11:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:23,795 INFO L225 Difference]: With dead ends: 90 [2018-12-03 15:11:23,795 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 15:11:23,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 15:11:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 15:11:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-03 15:11:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:11:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 15:11:23,799 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-12-03 15:11:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:23,800 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 15:11:23,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 15:11:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 15:11:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:11:23,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:23,800 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-12-03 15:11:23,800 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:23,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:23,801 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-12-03 15:11:23,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:23,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:23,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:11:23,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:23,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:24,038 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:11:26,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:26,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:26,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:26,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:11:26,008 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:11:26,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:26,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:11:26,017 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:11:26,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:11:26,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:11:26,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:26,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:11:26,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:11:26,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:11:26,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:11:28,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:11:28,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:11:28,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:11:28,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:11:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:28,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:33,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:33,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2018-12-03 15:11:33,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:33,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 15:11:33,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 15:11:33,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:11:33,668 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2018-12-03 15:11:38,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:38,336 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 15:11:38,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:11:38,337 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2018-12-03 15:11:38,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:38,338 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:11:38,338 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:11:38,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:11:38,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:11:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-03 15:11:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:11:38,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 15:11:38,343 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-12-03 15:11:38,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:38,343 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 15:11:38,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 15:11:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 15:11:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:11:38,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:38,344 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-12-03 15:11:38,344 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:38,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:38,344 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-12-03 15:11:38,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:38,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:38,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:11:38,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:38,345 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:38,615 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:11:38,873 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:11:39,142 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:11:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:41,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:41,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:41,306 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:11:41,306 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:11:41,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:41,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:41,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:41,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:11:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:41,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:41,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:11:41,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:11:41,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:11:41,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:11:44,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:11:44,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:11:44,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:11:44,083 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:11:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:44,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:11:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:49,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:11:49,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2018-12-03 15:11:49,213 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:11:49,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 15:11:49,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 15:11:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:11:49,214 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2018-12-03 15:11:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:11:53,023 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 15:11:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:11:53,023 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2018-12-03 15:11:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:11:53,024 INFO L225 Difference]: With dead ends: 94 [2018-12-03 15:11:53,024 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 15:11:53,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:11:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 15:11:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-12-03 15:11:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 15:11:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 15:11:53,030 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-12-03 15:11:53,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:11:53,030 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 15:11:53,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 15:11:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 15:11:53,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 15:11:53,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:11:53,031 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-12-03 15:11:53,031 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:11:53,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:11:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-12-03 15:11:53,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:11:53,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:53,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:11:53,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:11:53,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:11:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:11:53,276 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:11:55,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:55,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:55,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:11:55,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:11:55,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:11:55,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:11:55,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:11:55,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:11:55,179 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:11:55,244 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 15:11:55,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:11:55,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:11:55,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:11:55,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:11:55,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:11:55,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:11:58,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:11:58,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:11:58,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:11:58,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:11:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:11:58,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:04,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:04,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2018-12-03 15:12:04,189 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:04,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 15:12:04,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 15:12:04,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:12:04,191 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2018-12-03 15:12:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:08,379 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 15:12:08,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:12:08,380 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2018-12-03 15:12:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:08,381 INFO L225 Difference]: With dead ends: 96 [2018-12-03 15:12:08,381 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 15:12:08,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:12:08,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 15:12:08,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-03 15:12:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:12:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 15:12:08,387 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-12-03 15:12:08,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:08,387 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 15:12:08,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 15:12:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 15:12:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 15:12:08,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:08,388 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-12-03 15:12:08,388 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:08,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:08,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-12-03 15:12:08,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:08,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:08,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:12:08,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:08,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:10,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:10,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:10,491 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:10,491 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:12:10,491 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:12:10,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:10,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:10,501 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:12:10,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:12:10,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:12:10,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:12:10,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:10,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:12:10,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:12:10,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:12:10,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:12:13,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:12:13,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:12:13,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:12:13,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:12:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:13,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:19,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:19,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:19,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2018-12-03 15:12:19,379 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:19,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 15:12:19,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 15:12:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 15:12:19,380 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2018-12-03 15:12:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:23,939 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 15:12:23,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:12:23,940 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2018-12-03 15:12:23,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:23,941 INFO L225 Difference]: With dead ends: 98 [2018-12-03 15:12:23,941 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:12:23,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 15:12:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:12:23,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-12-03 15:12:23,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:12:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 15:12:23,946 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-12-03 15:12:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:23,946 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 15:12:23,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 15:12:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 15:12:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:12:23,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:23,947 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-12-03 15:12:23,948 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:23,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:23,948 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-12-03 15:12:23,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:23,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:23,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:12:23,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:23,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:24,204 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:12:24,438 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:12:24,615 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:12:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:26,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:26,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:26,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:12:26,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:12:26,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:26,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:26,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:26,798 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:12:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:26,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:26,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:12:26,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:12:26,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:12:26,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:12:29,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:12:29,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:12:30,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:12:30,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:12:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:30,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:35,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:35,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:35,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2018-12-03 15:12:35,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:35,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 15:12:35,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 15:12:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:12:35,842 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2018-12-03 15:12:40,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:40,174 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 15:12:40,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:12:40,175 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2018-12-03 15:12:40,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:40,176 INFO L225 Difference]: With dead ends: 100 [2018-12-03 15:12:40,176 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:12:40,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:12:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:12:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-03 15:12:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:12:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 15:12:40,181 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-12-03 15:12:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:40,181 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 15:12:40,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 15:12:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 15:12:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 15:12:40,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:40,182 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-12-03 15:12:40,182 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:40,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:40,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-12-03 15:12:40,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:40,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:40,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:12:40,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:40,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:40,447 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:12:40,678 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:12:40,915 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:12:41,145 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:12:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:43,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:43,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:12:43,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:12:43,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:12:43,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:12:43,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:12:43,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:12:43,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:12:43,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 15:12:43,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:12:43,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:12:43,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:12:43,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:12:43,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:12:43,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:12:47,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:12:47,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:12:47,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:12:47,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:12:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:47,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:12:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:12:53,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:12:53,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2018-12-03 15:12:53,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:12:53,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:12:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:12:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 15:12:53,711 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2018-12-03 15:12:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:12:57,984 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 15:12:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:12:57,985 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2018-12-03 15:12:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:12:57,986 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:12:57,986 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 15:12:57,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 15:12:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 15:12:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-03 15:12:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:12:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 15:12:57,992 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-12-03 15:12:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:12:57,992 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 15:12:57,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:12:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 15:12:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:12:57,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:12:57,993 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-12-03 15:12:57,993 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:12:57,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:12:57,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-12-03 15:12:57,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:12:57,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:57,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:12:57,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:12:57,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:12:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:12:58,225 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:13:00,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:00,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:00,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:00,322 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:13:00,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:13:00,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:00,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:00,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:13:00,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:13:00,356 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:13:00,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:13:00,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:00,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:13:00,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:13:00,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:13:00,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:13:03,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:13:03,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:13:03,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:13:03,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:13:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:04,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:10,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:10,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2018-12-03 15:13:10,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:10,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 15:13:10,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 15:13:10,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:13:10,155 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2018-12-03 15:13:14,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:14,611 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 15:13:14,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:13:14,611 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2018-12-03 15:13:14,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:14,612 INFO L225 Difference]: With dead ends: 104 [2018-12-03 15:13:14,612 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:13:14,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:13:14,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:13:14,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-12-03 15:13:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 15:13:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 15:13:14,619 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-12-03 15:13:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:14,619 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 15:13:14,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 15:13:14,619 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 15:13:14,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 15:13:14,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:14,620 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-12-03 15:13:14,620 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:14,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:14,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-12-03 15:13:14,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:14,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:14,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:13:14,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:14,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:16,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:16,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:16,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:16,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:13:16,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:13:16,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:16,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:16,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:16,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:13:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:16,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:16,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:13:16,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:13:17,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:13:17,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:13:20,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:13:20,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:13:20,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:13:20,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:13:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:20,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:27,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:27,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:27,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2018-12-03 15:13:27,314 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:27,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 15:13:27,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 15:13:27,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 15:13:27,317 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2018-12-03 15:13:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:32,112 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 15:13:32,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:13:32,113 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2018-12-03 15:13:32,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:32,114 INFO L225 Difference]: With dead ends: 106 [2018-12-03 15:13:32,114 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 15:13:32,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 15:13:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 15:13:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-12-03 15:13:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 15:13:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 15:13:32,121 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-12-03 15:13:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:32,121 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 15:13:32,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 15:13:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 15:13:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 15:13:32,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:32,122 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-12-03 15:13:32,122 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:32,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:32,122 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-12-03 15:13:32,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:32,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:32,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:13:32,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:32,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:32,399 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:13:32,648 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:13:32,896 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:13:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:35,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:35,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:35,419 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:13:35,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:13:35,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:35,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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:35,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:13:35,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:13:35,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 15:13:35,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:13:35,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:35,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:13:35,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:13:35,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:13:35,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:13:39,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:13:39,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:13:39,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:13:39,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:13:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:39,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:13:46,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:46,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:13:46,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2018-12-03 15:13:46,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:13:46,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 15:13:46,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 15:13:46,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:13:46,630 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2018-12-03 15:13:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:13:52,238 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 15:13:52,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:13:52,238 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2018-12-03 15:13:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:13:52,240 INFO L225 Difference]: With dead ends: 108 [2018-12-03 15:13:52,240 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 15:13:52,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:13:52,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 15:13:52,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-03 15:13:52,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:13:52,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 15:13:52,246 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-12-03 15:13:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:13:52,246 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 15:13:52,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 15:13:52,247 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 15:13:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:13:52,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:13:52,247 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-12-03 15:13:52,248 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:13:52,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:13:52,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-12-03 15:13:52,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:13:52,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:52,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:13:52,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:13:52,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:13:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:13:52,523 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:13:52,745 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:13:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:55,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:55,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:13:55,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:13:55,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:13:55,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:13:55,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:13:55,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:13:55,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:13:55,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:13:55,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:13:55,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:13:55,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:13:55,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:13:55,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:13:55,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:13:59,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:13:59,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:13:59,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:13:59,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:13:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:13:59,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:06,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:06,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2018-12-03 15:14:06,588 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:06,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 15:14:06,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 15:14:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 15:14:06,590 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2018-12-03 15:14:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:13,646 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 15:14:13,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:14:13,647 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2018-12-03 15:14:13,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:13,648 INFO L225 Difference]: With dead ends: 110 [2018-12-03 15:14:13,648 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:14:13,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 15:14:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:14:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-12-03 15:14:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:14:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 15:14:13,656 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-12-03 15:14:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:13,656 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 15:14:13,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 15:14:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 15:14:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:14:13,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:13,657 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-12-03 15:14:13,657 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:13,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:13,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-12-03 15:14:13,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:13,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:14:13,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:13,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:13,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:13,953 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:14:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:16,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:16,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:16,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:14:16,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:14:16,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:16,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:16,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:16,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:14:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:16,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:16,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:14:16,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:14:16,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:14:16,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:14:20,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:14:20,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:14:20,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:14:20,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:14:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:20,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:28,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:28,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2018-12-03 15:14:28,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:28,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 15:14:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 15:14:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:14:28,312 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2018-12-03 15:14:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:33,215 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 15:14:33,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:14:33,215 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2018-12-03 15:14:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:33,216 INFO L225 Difference]: With dead ends: 112 [2018-12-03 15:14:33,216 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 15:14:33,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:14:33,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 15:14:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-12-03 15:14:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 15:14:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 15:14:33,222 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-12-03 15:14:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:33,222 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 15:14:33,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 15:14:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 15:14:33,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 15:14:33,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:33,222 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-12-03 15:14:33,223 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:33,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:33,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-12-03 15:14:33,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:33,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:33,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:14:33,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:33,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:33,513 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:14:33,775 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:14:34,053 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:14:34,353 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:14:34,579 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:14:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:37,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:37,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:37,103 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:14:37,103 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:14:37,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:37,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:37,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:14:37,113 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:14:37,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 15:14:37,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:14:37,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:37,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:14:37,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:14:37,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:14:37,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:14:41,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:14:41,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:14:41,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:14:41,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:14:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:41,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:14:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:48,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:14:48,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2018-12-03 15:14:48,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:14:48,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 15:14:48,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 15:14:48,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 15:14:48,929 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2018-12-03 15:14:55,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:14:55,672 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 15:14:55,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:14:55,672 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2018-12-03 15:14:55,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:14:55,673 INFO L225 Difference]: With dead ends: 114 [2018-12-03 15:14:55,673 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 15:14:55,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 15:14:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 15:14:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-03 15:14:55,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:14:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 15:14:55,680 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-12-03 15:14:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:14:55,680 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 15:14:55,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 15:14:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 15:14:55,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:14:55,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:14:55,681 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-12-03 15:14:55,681 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:14:55,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:14:55,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-12-03 15:14:55,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:14:55,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:55,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:14:55,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:14:55,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:14:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:14:55,971 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:14:58,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:14:58,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:58,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:14:58,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:14:58,640 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:14:58,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:14:58,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:14:58,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:14:58,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:14:58,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:14:58,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:14:58,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:14:58,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:14:58,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:14:58,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:14:58,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:15:03,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:15:03,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:15:03,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:15:03,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:15:03,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:03,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:11,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:11,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2018-12-03 15:15:11,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:11,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-12-03 15:15:11,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-12-03 15:15:11,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:15:11,104 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2018-12-03 15:15:16,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:16,679 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 15:15:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:15:16,679 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2018-12-03 15:15:16,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:16,681 INFO L225 Difference]: With dead ends: 116 [2018-12-03 15:15:16,681 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 15:15:16,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:15:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 15:15:16,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-12-03 15:15:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:15:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 15:15:16,687 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-12-03 15:15:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:16,688 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 15:15:16,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-12-03 15:15:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 15:15:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:15:16,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:16,689 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-12-03 15:15:16,689 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:16,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-12-03 15:15:16,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:16,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:15:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:16,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:16,972 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:15:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:19,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:19,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:19,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:15:19,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:15:19,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:19,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:19,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:19,719 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:15:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:19,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:19,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:15:19,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:15:19,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:15:19,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:15:24,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:15:24,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:15:24,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:15:24,433 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:15:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:24,522 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:32,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:32,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2018-12-03 15:15:32,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:32,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-12-03 15:15:32,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-12-03 15:15:32,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 15:15:32,839 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2018-12-03 15:15:40,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:15:40,340 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-03 15:15:40,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:15:40,340 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2018-12-03 15:15:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:15:40,341 INFO L225 Difference]: With dead ends: 118 [2018-12-03 15:15:40,341 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 15:15:40,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 15:15:40,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 15:15:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-12-03 15:15:40,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 15:15:40,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 15:15:40,346 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-12-03 15:15:40,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:15:40,346 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 15:15:40,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-12-03 15:15:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 15:15:40,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 15:15:40,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:15:40,347 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-12-03 15:15:40,347 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:15:40,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:15:40,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-12-03 15:15:40,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:15:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:40,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:15:40,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:15:40,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:15:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:15:40,632 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:15:40,837 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:15:41,123 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:15:41,308 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:15:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:44,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:44,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:15:44,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:15:44,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:15:44,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:15:44,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:15:44,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:15:44,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:15:44,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 15:15:44,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:15:44,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:15:44,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:15:44,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:15:44,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:15:44,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:15:48,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:15:49,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:15:49,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:15:49,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:15:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:49,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:15:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:15:57,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:15:57,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2018-12-03 15:15:57,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:15:57,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-03 15:15:57,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-03 15:15:57,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:15:57,450 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2018-12-03 15:16:03,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:03,647 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-12-03 15:16:03,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:16:03,647 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2018-12-03 15:16:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:03,658 INFO L225 Difference]: With dead ends: 120 [2018-12-03 15:16:03,659 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 15:16:03,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:16:03,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 15:16:03,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-12-03 15:16:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 15:16:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 15:16:03,663 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-12-03 15:16:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:03,663 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 15:16:03,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-03 15:16:03,663 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 15:16:03,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 15:16:03,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:03,664 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-12-03 15:16:03,664 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:03,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-12-03 15:16:03,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:03,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:16:03,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:03,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:03,840 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:16:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:07,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:07,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:07,013 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:16:07,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:16:07,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:07,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:07,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:16:07,022 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:16:07,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:16:07,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:16:07,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:07,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:16:07,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:16:07,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:16:07,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:16:12,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:16:12,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:16:12,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:16:12,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:16:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:12,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:16:20,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:20,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:16:20,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2018-12-03 15:16:20,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:16:20,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-12-03 15:16:20,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-12-03 15:16:20,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 15:16:20,838 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2018-12-03 15:16:26,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:26,439 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-12-03 15:16:26,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:16:26,439 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2018-12-03 15:16:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:26,440 INFO L225 Difference]: With dead ends: 122 [2018-12-03 15:16:26,440 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 15:16:26,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 15:16:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 15:16:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-12-03 15:16:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 15:16:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-12-03 15:16:26,455 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-12-03 15:16:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:26,455 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-12-03 15:16:26,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-12-03 15:16:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-12-03 15:16:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 15:16:26,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:26,456 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-12-03 15:16:26,456 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:26,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:26,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-12-03 15:16:26,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:26,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:16:26,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:26,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:26,708 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:16:26,934 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:16:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:29,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:29,969 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:29,970 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:16:29,970 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:16:29,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:29,970 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:29,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:29,979 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:16:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:30,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:30,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:16:30,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:16:30,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:16:30,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:16:35,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:16:35,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:16:35,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:16:35,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:16:35,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:35,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:16:44,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:44,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:16:44,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2018-12-03 15:16:44,090 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:16:44,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-12-03 15:16:44,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-12-03 15:16:44,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:16:44,091 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2018-12-03 15:16:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:16:51,569 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-12-03 15:16:51,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:16:51,574 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2018-12-03 15:16:51,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:16:51,575 INFO L225 Difference]: With dead ends: 124 [2018-12-03 15:16:51,575 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 15:16:51,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:16:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 15:16:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-12-03 15:16:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 15:16:51,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-12-03 15:16:51,581 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-12-03 15:16:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:16:51,581 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-12-03 15:16:51,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-12-03 15:16:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-12-03 15:16:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 15:16:51,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:16:51,582 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-12-03 15:16:51,582 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:16:51,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:16:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-12-03 15:16:51,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:16:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:51,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:16:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:16:51,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:16:51,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:16:51,825 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:16:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:16:55,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:55,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:16:55,133 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:16:55,133 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:16:55,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:16:55,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:16:55,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:16:55,149 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:16:55,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 15:16:55,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:16:55,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:16:55,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:16:55,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:16:55,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:16:55,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:17:00,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:17:00,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:17:00,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:17:00,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:17:00,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:00,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:17:09,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:09,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:17:09,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2018-12-03 15:17:09,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:17:09,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-03 15:17:09,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-03 15:17:09,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 15:17:09,866 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2018-12-03 15:17:19,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:17:19,109 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-12-03 15:17:19,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:17:19,110 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2018-12-03 15:17:19,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:17:19,111 INFO L225 Difference]: With dead ends: 126 [2018-12-03 15:17:19,111 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 15:17:19,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 15:17:19,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 15:17:19,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-12-03 15:17:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 15:17:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-03 15:17:19,117 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-12-03 15:17:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:17:19,118 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-03 15:17:19,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-03 15:17:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-03 15:17:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 15:17:19,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:17:19,118 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-12-03 15:17:19,118 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:17:19,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:17:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-12-03 15:17:19,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:17:19,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:19,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:17:19,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:19,119 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:17:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:17:19,396 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:17:22,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:22,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:22,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:17:22,735 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:17:22,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:17:22,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:22,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:17:22,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:17:22,744 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:17:22,782 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:17:22,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:17:22,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:17:22,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:17:22,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:17:22,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:17:22,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:17:28,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:17:28,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:17:28,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:17:28,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:17:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:28,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:17:37,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:37,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:17:37,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2018-12-03 15:17:37,812 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:17:37,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-12-03 15:17:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-12-03 15:17:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:17:37,813 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2018-12-03 15:17:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:17:47,159 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-12-03 15:17:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:17:47,159 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2018-12-03 15:17:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:17:47,161 INFO L225 Difference]: With dead ends: 128 [2018-12-03 15:17:47,161 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:17:47,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:17:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:17:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-12-03 15:17:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 15:17:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-03 15:17:47,167 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-12-03 15:17:47,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:17:47,167 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-03 15:17:47,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-12-03 15:17:47,167 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-03 15:17:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 15:17:47,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:17:47,168 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-12-03 15:17:47,168 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:17:47,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:17:47,168 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-12-03 15:17:47,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:17:47,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:47,169 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:17:47,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:17:47,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:17:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:17:47,385 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 15:17:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:50,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:50,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:17:50,843 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:17:50,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:17:50,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:17:50,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:17:50,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:17:50,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:17:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:17:50,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:17:50,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:17:50,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:17:50,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:17:50,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:17:56,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:17:56,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:17:56,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:17:56,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:17:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:17:56,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:18:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:18:06,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:18:06,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2018-12-03 15:18:06,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:18:06,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-12-03 15:18:06,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-12-03 15:18:06,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 15:18:06,472 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2018-12-03 15:18:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:18:14,742 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-12-03 15:18:14,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:18:14,743 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2018-12-03 15:18:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:18:14,744 INFO L225 Difference]: With dead ends: 130 [2018-12-03 15:18:14,744 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 15:18:14,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 15:18:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 15:18:14,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-12-03 15:18:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 15:18:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-12-03 15:18:14,750 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-12-03 15:18:14,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:18:14,750 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-12-03 15:18:14,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-12-03 15:18:14,751 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-12-03 15:18:14,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 15:18:14,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:18:14,751 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-12-03 15:18:14,751 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:18:14,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:18:14,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-12-03 15:18:14,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:18:14,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:14,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:18:14,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:14,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:18:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:18:15,010 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:18:15,241 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:18:15,501 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:18:15,771 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:18:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:18:19,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:19,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:18:19,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:18:19,005 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:18:19,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:19,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:18:19,014 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:18:19,014 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:18:19,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 15:18:19,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:18:19,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:18:19,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:18:19,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:18:19,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:18:19,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:18:25,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:18:25,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:18:25,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:18:25,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:18:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:18:25,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:18:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:18:35,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:18:35,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2018-12-03 15:18:35,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:18:35,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-03 15:18:35,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-03 15:18:35,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 15:18:35,432 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2018-12-03 15:18:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:18:41,961 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-12-03 15:18:41,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:18:41,962 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2018-12-03 15:18:41,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:18:41,963 INFO L225 Difference]: With dead ends: 132 [2018-12-03 15:18:41,963 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 15:18:41,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 15:18:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 15:18:41,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-03 15:18:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 15:18:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-03 15:18:41,968 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-12-03 15:18:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:18:41,968 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-03 15:18:41,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-03 15:18:41,968 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-03 15:18:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 15:18:41,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:18:41,969 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-12-03 15:18:41,969 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:18:41,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:18:41,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-12-03 15:18:41,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:18:41,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:41,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:18:41,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:18:41,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:18:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:18:45,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:18:45,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:45,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:18:45,800 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:18:45,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:18:45,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:18:45,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:18:45,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:18:45,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:18:45,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:18:45,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:18:45,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:18:45,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:18:45,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:18:45,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:18:45,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:18:51,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:18:51,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:18:51,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:18:51,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:18:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:18:51,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:19:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:02,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:19:02,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2018-12-03 15:19:02,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:19:02,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-12-03 15:19:02,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-12-03 15:19:02,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 15:19:02,490 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2018-12-03 15:19:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:19:10,651 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-12-03 15:19:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:19:10,651 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2018-12-03 15:19:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:19:10,653 INFO L225 Difference]: With dead ends: 134 [2018-12-03 15:19:10,653 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 15:19:10,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 15:19:10,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 15:19:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-12-03 15:19:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 15:19:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-12-03 15:19:10,659 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-12-03 15:19:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:19:10,660 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-12-03 15:19:10,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-12-03 15:19:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-12-03 15:19:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 15:19:10,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:19:10,661 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-12-03 15:19:10,661 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:19:10,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:10,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-12-03 15:19:10,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:19:10,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:10,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:19:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:10,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:19:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:10,892 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:19:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:14,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:14,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:19:14,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:19:14,401 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:19:14,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:14,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:19:14,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:14,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:19:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:14,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:19:14,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:19:14,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:19:14,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:19:14,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:19:20,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:19:20,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:19:20,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:19:20,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:19:20,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:20,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:19:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:31,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:19:31,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2018-12-03 15:19:31,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:19:31,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-12-03 15:19:31,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-12-03 15:19:31,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:19:31,426 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2018-12-03 15:19:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:19:42,006 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-12-03 15:19:42,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:19:42,006 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2018-12-03 15:19:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:19:42,008 INFO L225 Difference]: With dead ends: 136 [2018-12-03 15:19:42,008 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:19:42,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:19:42,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:19:42,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-12-03 15:19:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 15:19:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-12-03 15:19:42,015 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-12-03 15:19:42,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:19:42,015 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-12-03 15:19:42,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-12-03 15:19:42,015 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-12-03 15:19:42,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 15:19:42,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:19:42,016 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-12-03 15:19:42,016 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:19:42,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:19:42,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-12-03 15:19:42,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:19:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:42,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:19:42,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:19:42,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:19:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:19:45,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:45,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:45,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:19:45,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:19:45,663 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:19:45,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:19:45,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:19:45,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:19:45,672 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:19:45,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 15:19:45,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:19:45,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:19:45,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:19:45,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:19:45,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:19:45,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:19:53,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:19:53,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:19:53,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:19:53,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:19:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:19:53,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:04,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:04,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2018-12-03 15:20:04,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:04,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-03 15:20:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-03 15:20:04,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2018-12-03 15:20:04,338 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2018-12-03 15:20:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:20:11,622 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-12-03 15:20:11,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:20:11,622 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2018-12-03 15:20:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:20:11,623 INFO L225 Difference]: With dead ends: 138 [2018-12-03 15:20:11,623 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 15:20:11,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2018-12-03 15:20:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 15:20:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-03 15:20:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:20:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-03 15:20:11,628 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-12-03 15:20:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:20:11,628 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-03 15:20:11,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-03 15:20:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-03 15:20:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:20:11,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:20:11,629 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-12-03 15:20:11,629 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:20:11,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:20:11,629 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-12-03 15:20:11,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:20:11,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:11,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:20:11,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:20:11,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:20:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:20:11,893 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:20:12,123 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:20:15,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:15,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:15,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:20:15,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:20:15,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:20:15,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:20:15,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:20:15,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:20:15,936 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:20:15,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:20:15,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:20:15,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:20:16,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-03 15:20:16,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:20:16,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:20:16,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-12-03 15:20:22,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-12-03 15:20:22,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-03 15:20:22,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 15:20:22,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2018-12-03 15:20:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:22,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:20:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:20:34,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:20:34,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2018-12-03 15:20:34,370 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:20:34,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-12-03 15:20:34,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-12-03 15:20:34,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 15:20:34,373 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states.