java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 13:52:03,366 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 13:52:03,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 13:52:03,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 13:52:03,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 13:52:03,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 13:52:03,383 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 13:52:03,385 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 13:52:03,387 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 13:52:03,387 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 13:52:03,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 13:52:03,389 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 13:52:03,390 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 13:52:03,391 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 13:52:03,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 13:52:03,394 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 13:52:03,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 13:52:03,399 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 13:52:03,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 13:52:03,405 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 13:52:03,406 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 13:52:03,407 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 13:52:03,418 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 13:52:03,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 13:52:03,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 13:52:03,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 13:52:03,420 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 13:52:03,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 13:52:03,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 13:52:03,423 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 13:52:03,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 13:52:03,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 13:52:03,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 13:52:03,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 13:52:03,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 13:52:03,426 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 13:52:03,426 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 [2019-01-08 13:52:03,439 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 13:52:03,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 13:52:03,440 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 13:52:03,440 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 13:52:03,440 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 13:52:03,440 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 13:52:03,440 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 13:52:03,441 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 13:52:03,441 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 13:52:03,441 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 13:52:03,441 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 13:52:03,441 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 13:52:03,442 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 13:52:03,442 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 13:52:03,442 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 13:52:03,443 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 13:52:03,443 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 13:52:03,443 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 13:52:03,443 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 13:52:03,444 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 13:52:03,444 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 13:52:03,444 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 13:52:03,444 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 13:52:03,444 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 13:52:03,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 13:52:03,445 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 13:52:03,445 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 13:52:03,445 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 13:52:03,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 13:52:03,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 13:52:03,446 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 13:52:03,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:52:03,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 13:52:03,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 13:52:03,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 13:52:03,447 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 13:52:03,447 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 13:52:03,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 13:52:03,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 13:52:03,447 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 13:52:03,499 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 13:52:03,514 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 13:52:03,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 13:52:03,521 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 13:52:03,522 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 13:52:03,523 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2019-01-08 13:52:03,523 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2019-01-08 13:52:03,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 13:52:03,580 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 13:52:03,580 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 13:52:03,580 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 13:52:03,581 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 13:52:03,597 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/1) ... [2019-01-08 13:52:03,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/1) ... [2019-01-08 13:52:03,645 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 13:52:03,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 13:52:03,646 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 13:52:03,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 13:52:03,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/1) ... [2019-01-08 13:52:03,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/1) ... [2019-01-08 13:52:03,662 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/1) ... [2019-01-08 13:52:03,662 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/1) ... [2019-01-08 13:52:03,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/1) ... [2019-01-08 13:52:03,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/1) ... [2019-01-08 13:52:03,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/1) ... [2019-01-08 13:52:03,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 13:52:03,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 13:52:03,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 13:52:03,683 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 13:52:03,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 13:52:03,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 13:52:03,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 13:52:04,126 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 13:52:04,126 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-08 13:52:04,127 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:52:04 BoogieIcfgContainer [2019-01-08 13:52:04,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 13:52:04,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 13:52:04,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 13:52:04,132 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 13:52:04,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:52:03" (1/2) ... [2019-01-08 13:52:04,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cd9d37 and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 01:52:04, skipping insertion in model container [2019-01-08 13:52:04,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:52:04" (2/2) ... [2019-01-08 13:52:04,136 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2019-01-08 13:52:04,148 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 13:52:04,157 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-08 13:52:04,176 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-08 13:52:04,209 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 13:52:04,210 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 13:52:04,210 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 13:52:04,210 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 13:52:04,211 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 13:52:04,211 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 13:52:04,211 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 13:52:04,211 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 13:52:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-08 13:52:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 13:52:04,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:04,233 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-08 13:52:04,235 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2019-01-08 13:52:04,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:04,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:04,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,294 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:04,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:52:04,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 13:52:04,458 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:52:04,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:52:04,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:52:04,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 13:52:04,481 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2019-01-08 13:52:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:04,604 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-08 13:52:04,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 13:52:04,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-08 13:52:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:04,618 INFO L225 Difference]: With dead ends: 24 [2019-01-08 13:52:04,618 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 13:52:04,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 13:52:04,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 13:52:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-01-08 13:52:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-08 13:52:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-08 13:52:04,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-01-08 13:52:04,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:04,660 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-08 13:52:04,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:52:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-08 13:52:04,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 13:52:04,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:04,661 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-08 13:52:04,661 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:04,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:04,662 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2019-01-08 13:52:04,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:04,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:52:04,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 13:52:04,980 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:52:04,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:52:04,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:52:04,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-08 13:52:04,983 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-01-08 13:52:05,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:05,248 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-08 13:52:05,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 13:52:05,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-08 13:52:05,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:05,250 INFO L225 Difference]: With dead ends: 18 [2019-01-08 13:52:05,250 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 13:52:05,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-08 13:52:05,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 13:52:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-01-08 13:52:05,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-08 13:52:05,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-08 13:52:05,256 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2019-01-08 13:52:05,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:05,257 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-08 13:52:05,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:52:05,257 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-08 13:52:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 13:52:05,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:05,259 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-08 13:52:05,259 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:05,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:05,260 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2019-01-08 13:52:05,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:05,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:05,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:52:05,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-08 13:52:05,321 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:52:05,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 13:52:05,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 13:52:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:52:05,323 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-01-08 13:52:05,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:05,372 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-08 13:52:05,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 13:52:05,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-08 13:52:05,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:05,373 INFO L225 Difference]: With dead ends: 19 [2019-01-08 13:52:05,373 INFO L226 Difference]: Without dead ends: 12 [2019-01-08 13:52:05,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:52:05,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-08 13:52:05,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-08 13:52:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-08 13:52:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-08 13:52:05,378 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-08 13:52:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:05,378 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-08 13:52:05,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 13:52:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-08 13:52:05,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-08 13:52:05,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:05,380 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-08 13:52:05,380 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:05,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:05,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2019-01-08 13:52:05,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:05,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:05,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:05,650 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-01-08 13:52:05,652 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [9], [11], [12], [13], [21] [2019-01-08 13:52:05,695 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 13:52:05,695 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 13:52:05,849 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 13:52:05,850 INFO L272 AbstractInterpreter]: Visited 8 different actions 26 times. Merged at 6 different actions 18 times. Never widened. Performed 252 root evaluator evaluations with a maximum evaluation depth of 3. Performed 252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-08 13:52:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:05,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 13:52:05,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,858 INFO L193 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 [2019-01-08 13:52:05,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:05,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:05,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:06,052 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 6 treesize of output 5 [2019-01-08 13:52:06,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:06,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:06,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:06,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:06,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-08 13:52:06,337 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:06,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 13:52:06,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 13:52:06,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-08 13:52:06,339 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-01-08 13:52:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:06,608 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-08 13:52:06,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 13:52:06,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-01-08 13:52:06,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:06,610 INFO L225 Difference]: With dead ends: 21 [2019-01-08 13:52:06,610 INFO L226 Difference]: Without dead ends: 20 [2019-01-08 13:52:06,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-08 13:52:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-08 13:52:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-08 13:52:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 13:52:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-08 13:52:06,618 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2019-01-08 13:52:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:06,618 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-08 13:52:06,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 13:52:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-08 13:52:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-08 13:52:06,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:06,619 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2019-01-08 13:52:06,620 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:06,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:06,620 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2019-01-08 13:52:06,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:06,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:06,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:06,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:06,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:06,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:06,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:06,758 INFO L193 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 [2019-01-08 13:52:06,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:06,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:06,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-08 13:52:06,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:06,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:06,803 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 6 treesize of output 5 [2019-01-08 13:52:06,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:06,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:06,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:07,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2019-01-08 13:52:07,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:07,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 13:52:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 13:52:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:52:07,441 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-01-08 13:52:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:07,603 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-08 13:52:07,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 13:52:07,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-08 13:52:07,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:07,605 INFO L225 Difference]: With dead ends: 26 [2019-01-08 13:52:07,605 INFO L226 Difference]: Without dead ends: 25 [2019-01-08 13:52:07,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-08 13:52:07,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-08 13:52:07,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-01-08 13:52:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-08 13:52:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-08 13:52:07,611 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2019-01-08 13:52:07,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:07,611 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-08 13:52:07,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 13:52:07,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-08 13:52:07,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-08 13:52:07,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:07,613 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2019-01-08 13:52:07,613 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:07,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:07,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2019-01-08 13:52:07,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:07,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:07,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:07,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:07,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:07,731 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:07,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:07,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:07,732 INFO L193 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 [2019-01-08 13:52:07,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:07,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:07,770 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:07,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:07,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:07,796 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 6 treesize of output 5 [2019-01-08 13:52:07,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:07,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:07,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:08,169 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:08,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2019-01-08 13:52:08,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:08,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 13:52:08,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 13:52:08,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-08 13:52:08,192 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-01-08 13:52:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:08,465 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-08 13:52:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 13:52:08,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-08 13:52:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:08,466 INFO L225 Difference]: With dead ends: 31 [2019-01-08 13:52:08,466 INFO L226 Difference]: Without dead ends: 30 [2019-01-08 13:52:08,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2019-01-08 13:52:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-08 13:52:08,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-01-08 13:52:08,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-08 13:52:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-08 13:52:08,473 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2019-01-08 13:52:08,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:08,473 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-08 13:52:08,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 13:52:08,474 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-08 13:52:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-08 13:52:08,475 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:08,475 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2019-01-08 13:52:08,475 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:08,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:08,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2019-01-08 13:52:08,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:08,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:08,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:08,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:08,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:08,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:08,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:08,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,625 INFO L193 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 [2019-01-08 13:52:08,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:08,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:08,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:08,690 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 6 treesize of output 5 [2019-01-08 13:52:08,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:08,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:08,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:08,827 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:08,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2019-01-08 13:52:08,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:08,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 13:52:08,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 13:52:08,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-01-08 13:52:08,980 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-01-08 13:52:09,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:09,220 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-08 13:52:09,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 13:52:09,223 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-08 13:52:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:09,224 INFO L225 Difference]: With dead ends: 36 [2019-01-08 13:52:09,224 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 13:52:09,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=371, Unknown=0, NotChecked=0, Total=600 [2019-01-08 13:52:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 13:52:09,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-08 13:52:09,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 13:52:09,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-08 13:52:09,232 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2019-01-08 13:52:09,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:09,232 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-08 13:52:09,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 13:52:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-08 13:52:09,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-08 13:52:09,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:09,233 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2019-01-08 13:52:09,234 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:09,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:09,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2019-01-08 13:52:09,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:09,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:09,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:09,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:09,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:09,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:09,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:09,494 INFO L193 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 [2019-01-08 13:52:09,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:09,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:09,535 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-08 13:52:09,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:09,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:09,563 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 6 treesize of output 5 [2019-01-08 13:52:09,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:09,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:09,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:09,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:09,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:09,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2019-01-08 13:52:09,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:09,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-08 13:52:09,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-08 13:52:09,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2019-01-08 13:52:09,896 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2019-01-08 13:52:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:10,510 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-08 13:52:10,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 13:52:10,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-01-08 13:52:10,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:10,511 INFO L225 Difference]: With dead ends: 41 [2019-01-08 13:52:10,511 INFO L226 Difference]: Without dead ends: 40 [2019-01-08 13:52:10,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=312, Invalid=500, Unknown=0, NotChecked=0, Total=812 [2019-01-08 13:52:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-08 13:52:10,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-08 13:52:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 13:52:10,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-08 13:52:10,519 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2019-01-08 13:52:10,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:10,519 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-08 13:52:10,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-08 13:52:10,519 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-08 13:52:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-08 13:52:10,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:10,520 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2019-01-08 13:52:10,520 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:10,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2019-01-08 13:52:10,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:10,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:10,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:10,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:11,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:11,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:11,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:11,038 INFO L193 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 [2019-01-08 13:52:11,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:11,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:11,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:11,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:11,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:11,116 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 6 treesize of output 5 [2019-01-08 13:52:11,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:11,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:11,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:11,788 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:11,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2019-01-08 13:52:11,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:11,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-08 13:52:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-08 13:52:11,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:52:11,809 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2019-01-08 13:52:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:12,329 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-08 13:52:12,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 13:52:12,333 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-01-08 13:52:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:12,334 INFO L225 Difference]: With dead ends: 46 [2019-01-08 13:52:12,334 INFO L226 Difference]: Without dead ends: 45 [2019-01-08 13:52:12,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-01-08 13:52:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-08 13:52:12,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-01-08 13:52:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-08 13:52:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-08 13:52:12,343 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2019-01-08 13:52:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:12,343 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-08 13:52:12,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-08 13:52:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-08 13:52:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-08 13:52:12,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:12,345 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2019-01-08 13:52:12,345 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:12,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:12,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2019-01-08 13:52:12,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:12,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:12,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:12,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:12,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:12,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,560 INFO L193 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 [2019-01-08 13:52:12,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:12,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:12,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:12,610 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 6 treesize of output 5 [2019-01-08 13:52:12,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:12,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:12,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:12,900 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:13,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:13,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2019-01-08 13:52:13,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:13,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-08 13:52:13,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-08 13:52:13,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=499, Unknown=0, NotChecked=0, Total=812 [2019-01-08 13:52:13,196 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2019-01-08 13:52:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:13,501 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-08 13:52:13,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 13:52:13,501 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-01-08 13:52:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:13,502 INFO L225 Difference]: With dead ends: 51 [2019-01-08 13:52:13,502 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 13:52:13,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=517, Invalid=815, Unknown=0, NotChecked=0, Total=1332 [2019-01-08 13:52:13,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 13:52:13,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-01-08 13:52:13,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 13:52:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-08 13:52:13,512 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2019-01-08 13:52:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:13,512 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-08 13:52:13,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-08 13:52:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-08 13:52:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-08 13:52:13,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:13,514 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2019-01-08 13:52:13,514 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:13,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2019-01-08 13:52:13,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:13,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:13,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:13,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:13,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:14,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:14,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:14,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:14,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:14,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:14,281 INFO L193 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 [2019-01-08 13:52:14,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:14,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:14,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-08 13:52:14,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:14,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:14,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 6 treesize of output 5 [2019-01-08 13:52:14,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:14,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:14,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:14,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:14,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:14,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2019-01-08 13:52:14,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:14,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-08 13:52:14,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-08 13:52:14,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=605, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:52:14,794 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2019-01-08 13:52:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:15,209 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-08 13:52:15,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-08 13:52:15,210 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-01-08 13:52:15,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:15,212 INFO L225 Difference]: With dead ends: 56 [2019-01-08 13:52:15,212 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 13:52:15,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=639, Invalid=1001, Unknown=0, NotChecked=0, Total=1640 [2019-01-08 13:52:15,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 13:52:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-08 13:52:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 13:52:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-08 13:52:15,222 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2019-01-08 13:52:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:15,223 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-08 13:52:15,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-08 13:52:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-08 13:52:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-08 13:52:15,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:15,224 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2019-01-08 13:52:15,224 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:15,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2019-01-08 13:52:15,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:15,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:15,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:15,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:15,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:15,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:15,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:15,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:15,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:15,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:15,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:15,580 INFO L193 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 [2019-01-08 13:52:15,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:15,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:15,639 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:15,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:15,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:15,664 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 6 treesize of output 5 [2019-01-08 13:52:15,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:15,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:15,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:15,825 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:15,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:16,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:16,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2019-01-08 13:52:16,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:16,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-08 13:52:16,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-08 13:52:16,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=721, Unknown=0, NotChecked=0, Total=1190 [2019-01-08 13:52:16,042 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2019-01-08 13:52:16,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:16,486 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-08 13:52:16,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-08 13:52:16,486 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2019-01-08 13:52:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:16,488 INFO L225 Difference]: With dead ends: 61 [2019-01-08 13:52:16,488 INFO L226 Difference]: Without dead ends: 60 [2019-01-08 13:52:16,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=774, Invalid=1206, Unknown=0, NotChecked=0, Total=1980 [2019-01-08 13:52:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-08 13:52:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-01-08 13:52:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-08 13:52:16,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-08 13:52:16,498 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2019-01-08 13:52:16,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:16,499 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-08 13:52:16,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-08 13:52:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-08 13:52:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-08 13:52:16,500 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:16,500 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2019-01-08 13:52:16,500 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:16,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2019-01-08 13:52:16,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:16,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:16,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:16,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:16,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:16,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:16,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:16,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:16,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:16,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:16,746 INFO L193 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 [2019-01-08 13:52:16,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:16,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:16,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:16,805 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 6 treesize of output 5 [2019-01-08 13:52:16,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:16,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:16,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:17,089 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:17,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2019-01-08 13:52:17,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:17,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 13:52:17,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 13:52:17,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=847, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:17,427 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-01-08 13:52:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:17,795 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-08 13:52:17,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-08 13:52:17,796 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-01-08 13:52:17,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:17,797 INFO L225 Difference]: With dead ends: 66 [2019-01-08 13:52:17,797 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 13:52:17,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=922, Invalid=1430, Unknown=0, NotChecked=0, Total=2352 [2019-01-08 13:52:17,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 13:52:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-01-08 13:52:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-08 13:52:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-08 13:52:17,809 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2019-01-08 13:52:17,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:17,809 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-08 13:52:17,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 13:52:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-08 13:52:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-08 13:52:17,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:17,811 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2019-01-08 13:52:17,811 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:17,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:17,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2019-01-08 13:52:17,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:17,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:18,346 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:18,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:18,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:18,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:18,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:18,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:18,347 INFO L193 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 [2019-01-08 13:52:18,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:18,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:18,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-08 13:52:18,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:18,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:18,448 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 6 treesize of output 5 [2019-01-08 13:52:18,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:18,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:18,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:18,909 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:18,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:19,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:19,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2019-01-08 13:52:19,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:19,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-08 13:52:19,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-08 13:52:19,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=983, Unknown=0, NotChecked=0, Total=1640 [2019-01-08 13:52:19,327 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2019-01-08 13:52:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:19,827 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-08 13:52:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-08 13:52:19,828 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-01-08 13:52:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:19,828 INFO L225 Difference]: With dead ends: 71 [2019-01-08 13:52:19,829 INFO L226 Difference]: Without dead ends: 70 [2019-01-08 13:52:19,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1083, Invalid=1673, Unknown=0, NotChecked=0, Total=2756 [2019-01-08 13:52:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-08 13:52:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-01-08 13:52:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-08 13:52:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-08 13:52:19,842 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2019-01-08 13:52:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:19,842 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-08 13:52:19,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-08 13:52:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-08 13:52:19,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-08 13:52:19,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:19,843 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2019-01-08 13:52:19,844 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:19,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:19,844 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2019-01-08 13:52:19,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:19,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:19,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:19,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:19,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:20,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:20,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:20,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,347 INFO L193 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 [2019-01-08 13:52:20,355 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:20,356 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:20,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:20,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:20,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:20,423 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 6 treesize of output 5 [2019-01-08 13:52:20,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:20,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:20,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:21,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:22,003 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:22,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:22,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2019-01-08 13:52:22,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:22,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-08 13:52:22,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-08 13:52:22,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=1129, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:22,024 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2019-01-08 13:52:22,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:22,585 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-08 13:52:22,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-08 13:52:22,585 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2019-01-08 13:52:22,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:22,586 INFO L225 Difference]: With dead ends: 76 [2019-01-08 13:52:22,586 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 13:52:22,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1257, Invalid=1935, Unknown=0, NotChecked=0, Total=3192 [2019-01-08 13:52:22,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 13:52:22,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-01-08 13:52:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-08 13:52:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-08 13:52:22,598 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2019-01-08 13:52:22,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:22,598 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-08 13:52:22,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-08 13:52:22,598 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-08 13:52:22,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-08 13:52:22,599 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:22,599 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2019-01-08 13:52:22,600 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:22,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:22,600 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2019-01-08 13:52:22,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:22,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:22,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:22,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:22,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:22,888 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:22,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:22,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:22,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:22,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:22,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:22,889 INFO L193 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 [2019-01-08 13:52:22,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:22,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:22,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:22,981 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 6 treesize of output 5 [2019-01-08 13:52:22,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:23,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:23,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:23,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:23,783 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:23,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:23,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2019-01-08 13:52:23,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:23,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 13:52:23,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 13:52:23,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-01-08 13:52:23,806 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2019-01-08 13:52:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:24,477 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-08 13:52:24,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-08 13:52:24,477 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-01-08 13:52:24,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:24,478 INFO L225 Difference]: With dead ends: 81 [2019-01-08 13:52:24,478 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 13:52:24,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1444, Invalid=2216, Unknown=0, NotChecked=0, Total=3660 [2019-01-08 13:52:24,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 13:52:24,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-01-08 13:52:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 13:52:24,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-08 13:52:24,491 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2019-01-08 13:52:24,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:24,492 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-08 13:52:24,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 13:52:24,492 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-08 13:52:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-08 13:52:24,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:24,493 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2019-01-08 13:52:24,493 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:24,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2019-01-08 13:52:24,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:24,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:24,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:24,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:24,771 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:24,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:24,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:24,771 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:24,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:24,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:24,772 INFO L193 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 [2019-01-08 13:52:24,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:24,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:24,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-08 13:52:24,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:24,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:24,888 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 6 treesize of output 5 [2019-01-08 13:52:24,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:24,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:24,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:25,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:26,750 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:26,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:26,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2019-01-08 13:52:26,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:26,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-08 13:52:26,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-08 13:52:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=1451, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:26,771 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2019-01-08 13:52:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:27,285 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-08 13:52:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-08 13:52:27,286 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2019-01-08 13:52:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:27,287 INFO L225 Difference]: With dead ends: 86 [2019-01-08 13:52:27,287 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 13:52:27,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1644, Invalid=2516, Unknown=0, NotChecked=0, Total=4160 [2019-01-08 13:52:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 13:52:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-01-08 13:52:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-08 13:52:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-08 13:52:27,302 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2019-01-08 13:52:27,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:27,303 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-08 13:52:27,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-08 13:52:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-08 13:52:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-08 13:52:27,304 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:27,304 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2019-01-08 13:52:27,304 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:27,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:27,305 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2019-01-08 13:52:27,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:27,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:27,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:27,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:27,889 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:27,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:27,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:27,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:27,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:27,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:27,890 INFO L193 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 [2019-01-08 13:52:27,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:27,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:27,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:27,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:27,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:27,975 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 6 treesize of output 5 [2019-01-08 13:52:27,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:27,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:27,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:28,256 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:28,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:28,684 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:28,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:28,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2019-01-08 13:52:28,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:28,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-08 13:52:28,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-08 13:52:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1129, Invalid=1627, Unknown=0, NotChecked=0, Total=2756 [2019-01-08 13:52:28,706 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2019-01-08 13:52:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:29,379 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-08 13:52:29,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-08 13:52:29,379 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2019-01-08 13:52:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:29,380 INFO L225 Difference]: With dead ends: 91 [2019-01-08 13:52:29,380 INFO L226 Difference]: Without dead ends: 90 [2019-01-08 13:52:29,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1857, Invalid=2835, Unknown=0, NotChecked=0, Total=4692 [2019-01-08 13:52:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-08 13:52:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-01-08 13:52:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-08 13:52:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-08 13:52:29,393 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2019-01-08 13:52:29,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:29,394 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-08 13:52:29,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-08 13:52:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-08 13:52:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-08 13:52:29,395 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:29,395 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2019-01-08 13:52:29,395 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:29,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:29,395 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2019-01-08 13:52:29,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:29,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:29,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:29,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:29,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:29,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:29,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:29,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:29,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:29,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:29,757 INFO L193 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 [2019-01-08 13:52:29,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:29,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:29,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:29,834 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 6 treesize of output 5 [2019-01-08 13:52:29,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:29,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:29,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:30,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:30,716 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:30,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:30,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 55 [2019-01-08 13:52:30,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:30,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 13:52:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 13:52:30,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1267, Invalid=1813, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 13:52:30,737 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2019-01-08 13:52:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:31,341 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-08 13:52:31,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-08 13:52:31,343 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2019-01-08 13:52:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:31,343 INFO L225 Difference]: With dead ends: 96 [2019-01-08 13:52:31,344 INFO L226 Difference]: Without dead ends: 95 [2019-01-08 13:52:31,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2083, Invalid=3173, Unknown=0, NotChecked=0, Total=5256 [2019-01-08 13:52:31,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-08 13:52:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-08 13:52:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-08 13:52:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-08 13:52:31,356 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2019-01-08 13:52:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:31,357 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-08 13:52:31,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 13:52:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-08 13:52:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-08 13:52:31,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:31,358 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2019-01-08 13:52:31,358 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:31,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:31,358 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2019-01-08 13:52:31,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:31,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:31,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:31,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:31,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:31,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:31,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:31,723 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:31,723 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:31,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:31,723 INFO L193 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 [2019-01-08 13:52:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:31,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:31,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-08 13:52:31,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:31,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:31,955 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 6 treesize of output 5 [2019-01-08 13:52:31,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:31,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:31,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:32,301 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:32,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:32,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:32,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2019-01-08 13:52:32,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:32,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-08 13:52:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-08 13:52:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=2009, Unknown=0, NotChecked=0, Total=3422 [2019-01-08 13:52:32,878 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2019-01-08 13:52:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:33,574 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-08 13:52:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-08 13:52:33,575 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2019-01-08 13:52:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:33,575 INFO L225 Difference]: With dead ends: 101 [2019-01-08 13:52:33,576 INFO L226 Difference]: Without dead ends: 100 [2019-01-08 13:52:33,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2322, Invalid=3530, Unknown=0, NotChecked=0, Total=5852 [2019-01-08 13:52:33,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-08 13:52:33,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-01-08 13:52:33,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 13:52:33,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-08 13:52:33,588 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2019-01-08 13:52:33,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:33,588 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-08 13:52:33,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-08 13:52:33,588 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-08 13:52:33,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-08 13:52:33,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:33,589 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2019-01-08 13:52:33,589 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:33,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2019-01-08 13:52:33,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:33,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:33,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:33,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:33,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:34,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:34,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:34,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:34,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:34,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:34,026 INFO L193 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 [2019-01-08 13:52:34,036 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:34,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:34,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:34,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:34,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:34,134 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 6 treesize of output 5 [2019-01-08 13:52:34,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:34,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:34,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:34,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:35,227 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:35,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:35,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2019-01-08 13:52:35,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:35,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-08 13:52:35,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-08 13:52:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=2215, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 13:52:35,249 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2019-01-08 13:52:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:35,951 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-08 13:52:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-08 13:52:35,952 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-01-08 13:52:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:35,953 INFO L225 Difference]: With dead ends: 106 [2019-01-08 13:52:35,953 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 13:52:35,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2574, Invalid=3906, Unknown=0, NotChecked=0, Total=6480 [2019-01-08 13:52:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 13:52:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-01-08 13:52:35,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-08 13:52:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-08 13:52:35,967 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2019-01-08 13:52:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:35,967 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-08 13:52:35,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-08 13:52:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-08 13:52:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-08 13:52:35,968 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:35,968 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2019-01-08 13:52:35,968 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2019-01-08 13:52:35,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:35,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:35,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:35,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:35,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:37,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:37,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:37,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:37,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:37,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:37,134 INFO L193 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 [2019-01-08 13:52:37,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:37,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:37,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52: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 6 treesize of output 5 [2019-01-08 13:52:37,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:37,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:37,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:37,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:38,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:38,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 64 [2019-01-08 13:52:38,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:38,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 13:52:38,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 13:52:38,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1729, Invalid=2431, Unknown=0, NotChecked=0, Total=4160 [2019-01-08 13:52:38,428 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2019-01-08 13:52:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:39,286 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-08 13:52:39,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-08 13:52:39,287 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2019-01-08 13:52:39,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:39,288 INFO L225 Difference]: With dead ends: 111 [2019-01-08 13:52:39,288 INFO L226 Difference]: Without dead ends: 110 [2019-01-08 13:52:39,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2839, Invalid=4301, Unknown=0, NotChecked=0, Total=7140 [2019-01-08 13:52:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-08 13:52:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-01-08 13:52:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-08 13:52:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-08 13:52:39,302 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2019-01-08 13:52:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:39,302 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-08 13:52:39,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 13:52:39,302 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-08 13:52:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-08 13:52:39,303 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:39,303 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2019-01-08 13:52:39,303 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2019-01-08 13:52:39,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:39,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:39,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:39,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:39,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:39,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:39,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:39,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:39,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:39,708 INFO L193 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 [2019-01-08 13:52:39,717 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:39,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:39,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-08 13:52:39,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:39,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:39,841 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 6 treesize of output 5 [2019-01-08 13:52:39,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:39,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:39,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:40,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:40,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:41,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:41,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2019-01-08 13:52:41,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:41,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-08 13:52:41,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-08 13:52:41,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1899, Invalid=2657, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 13:52:41,206 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2019-01-08 13:52:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:42,062 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-08 13:52:42,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-08 13:52:42,063 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2019-01-08 13:52:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:42,064 INFO L225 Difference]: With dead ends: 116 [2019-01-08 13:52:42,064 INFO L226 Difference]: Without dead ends: 115 [2019-01-08 13:52:42,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3117, Invalid=4715, Unknown=0, NotChecked=0, Total=7832 [2019-01-08 13:52:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-08 13:52:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-01-08 13:52:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-08 13:52:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-08 13:52:42,079 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2019-01-08 13:52:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:42,080 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-08 13:52:42,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-08 13:52:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-08 13:52:42,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-08 13:52:42,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:42,081 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2019-01-08 13:52:42,081 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:42,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2019-01-08 13:52:42,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:42,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:42,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:42,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:42,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:42,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:42,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:42,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:42,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:42,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:42,555 INFO L193 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 [2019-01-08 13:52:42,567 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:42,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:42,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:42,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:42,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:42,652 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 6 treesize of output 5 [2019-01-08 13:52:42,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:42,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:42,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:43,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:43,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:43,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2019-01-08 13:52:43,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:43,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-08 13:52:43,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-08 13:52:43,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=2893, Unknown=0, NotChecked=0, Total=4970 [2019-01-08 13:52:43,832 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2019-01-08 13:52:44,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:44,912 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-01-08 13:52:44,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-08 13:52:44,912 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2019-01-08 13:52:44,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:44,913 INFO L225 Difference]: With dead ends: 121 [2019-01-08 13:52:44,913 INFO L226 Difference]: Without dead ends: 120 [2019-01-08 13:52:44,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2526 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3408, Invalid=5148, Unknown=0, NotChecked=0, Total=8556 [2019-01-08 13:52:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-08 13:52:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-01-08 13:52:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-08 13:52:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-08 13:52:44,933 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2019-01-08 13:52:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:44,933 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-08 13:52:44,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-08 13:52:44,933 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-08 13:52:44,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-08 13:52:44,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:44,934 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2019-01-08 13:52:44,934 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:44,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:44,935 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2019-01-08 13:52:44,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:44,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:44,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:45,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:45,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:45,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:45,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:45,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:45,972 INFO L193 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 [2019-01-08 13:52:45,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:45,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:46,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:46,066 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 6 treesize of output 5 [2019-01-08 13:52:46,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:46,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:46,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:46,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:46,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:47,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:47,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2019-01-08 13:52:47,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:47,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 13:52:47,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 13:52:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2263, Invalid=3139, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:52:47,345 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2019-01-08 13:52:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:48,373 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-08 13:52:48,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-08 13:52:48,374 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2019-01-08 13:52:48,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:48,375 INFO L225 Difference]: With dead ends: 126 [2019-01-08 13:52:48,375 INFO L226 Difference]: Without dead ends: 125 [2019-01-08 13:52:48,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3712, Invalid=5600, Unknown=0, NotChecked=0, Total=9312 [2019-01-08 13:52:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-08 13:52:48,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-01-08 13:52:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-08 13:52:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-01-08 13:52:48,390 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2019-01-08 13:52:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:48,391 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-01-08 13:52:48,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 13:52:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-01-08 13:52:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-08 13:52:48,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:48,392 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2019-01-08 13:52:48,392 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:48,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:48,392 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2019-01-08 13:52:48,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:48,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:48,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:48,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:49,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:49,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:49,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:49,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:49,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:49,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:49,068 INFO L193 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 [2019-01-08 13:52:49,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:49,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:49,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-08 13:52:49,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:49,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:49,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 6 treesize of output 5 [2019-01-08 13:52:49,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:49,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:49,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:49,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:50,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:50,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 76 [2019-01-08 13:52:50,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:50,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-08 13:52:50,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-08 13:52:50,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2457, Invalid=3395, Unknown=0, NotChecked=0, Total=5852 [2019-01-08 13:52:50,842 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2019-01-08 13:52:51,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:51,750 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-01-08 13:52:51,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-08 13:52:51,750 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2019-01-08 13:52:51,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:51,751 INFO L225 Difference]: With dead ends: 131 [2019-01-08 13:52:51,751 INFO L226 Difference]: Without dead ends: 130 [2019-01-08 13:52:51,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4029, Invalid=6071, Unknown=0, NotChecked=0, Total=10100 [2019-01-08 13:52:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-08 13:52:51,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-01-08 13:52:51,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-08 13:52:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-01-08 13:52:51,768 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2019-01-08 13:52:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:51,768 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-01-08 13:52:51,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-08 13:52:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-01-08 13:52:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-08 13:52:51,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:51,769 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2019-01-08 13:52:51,769 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:51,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:51,769 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2019-01-08 13:52:51,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:51,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:51,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:51,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:51,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:52,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:52,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:52,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:52,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:52,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:52,410 INFO L193 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 [2019-01-08 13:52:52,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:52,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:52,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:52,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:52,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:52,523 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 6 treesize of output 5 [2019-01-08 13:52:52,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:52,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:52,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:53,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:54,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:54,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:54,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2019-01-08 13:52:54,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:54,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-08 13:52:54,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-08 13:52:54,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2659, Invalid=3661, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:52:54,055 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2019-01-08 13:52:55,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:55,268 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-01-08 13:52:55,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-08 13:52:55,268 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2019-01-08 13:52:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:55,269 INFO L225 Difference]: With dead ends: 136 [2019-01-08 13:52:55,269 INFO L226 Difference]: Without dead ends: 135 [2019-01-08 13:52:55,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4359, Invalid=6561, Unknown=0, NotChecked=0, Total=10920 [2019-01-08 13:52:55,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-08 13:52:55,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-01-08 13:52:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-08 13:52:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-01-08 13:52:55,293 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2019-01-08 13:52:55,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:55,293 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-01-08 13:52:55,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-08 13:52:55,293 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-01-08 13:52:55,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-08 13:52:55,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:55,294 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2019-01-08 13:52:55,294 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:55,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:55,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2019-01-08 13:52:55,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:55,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:55,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:55,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:55,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:55,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:55,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:55,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:55,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:55,848 INFO L193 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 [2019-01-08 13:52:55,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:55,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:55,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:55,966 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 6 treesize of output 5 [2019-01-08 13:52:55,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:56,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:56,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:52:56,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:56,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:57,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:57,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 82 [2019-01-08 13:52:57,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:57,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-08 13:52:57,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-08 13:52:57,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2869, Invalid=3937, Unknown=0, NotChecked=0, Total=6806 [2019-01-08 13:52:57,774 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2019-01-08 13:52:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:58,809 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-01-08 13:52:58,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-08 13:52:58,810 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2019-01-08 13:52:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:58,810 INFO L225 Difference]: With dead ends: 141 [2019-01-08 13:52:58,811 INFO L226 Difference]: Without dead ends: 140 [2019-01-08 13:52:58,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4702, Invalid=7070, Unknown=0, NotChecked=0, Total=11772 [2019-01-08 13:52:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-08 13:52:58,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-01-08 13:52:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-08 13:52:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-01-08 13:52:58,835 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2019-01-08 13:52:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:58,835 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-01-08 13:52:58,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-08 13:52:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-01-08 13:52:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-08 13:52:58,836 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:58,836 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2019-01-08 13:52:58,837 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:52:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2019-01-08 13:52:58,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:58,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:58,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:59,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:59,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:59,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:59,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:59,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:59,631 INFO L193 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 [2019-01-08 13:52:59,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:59,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:59,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-08 13:52:59,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:59,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:59,830 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 6 treesize of output 5 [2019-01-08 13:52:59,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:52:59,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:52:59,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:01,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:01,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:02,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:02,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2019-01-08 13:53:02,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:02,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-08 13:53:02,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-08 13:53:02,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3087, Invalid=4223, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:53:02,599 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2019-01-08 13:53:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:03,753 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-01-08 13:53:03,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-08 13:53:03,754 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-01-08 13:53:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:03,755 INFO L225 Difference]: With dead ends: 146 [2019-01-08 13:53:03,755 INFO L226 Difference]: Without dead ends: 145 [2019-01-08 13:53:03,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5058, Invalid=7598, Unknown=0, NotChecked=0, Total=12656 [2019-01-08 13:53:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-08 13:53:03,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-01-08 13:53:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-08 13:53:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-01-08 13:53:03,776 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2019-01-08 13:53:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:03,776 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-01-08 13:53:03,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-08 13:53:03,776 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-01-08 13:53:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-08 13:53:03,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:03,777 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2019-01-08 13:53:03,777 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:03,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2019-01-08 13:53:03,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:03,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:03,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:03,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:03,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:04,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:04,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:04,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:04,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:04,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:04,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:04,435 INFO L193 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 [2019-01-08 13:53:04,445 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:04,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:04,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:04,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:04,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:04,563 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 6 treesize of output 5 [2019-01-08 13:53:04,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:04,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:04,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:05,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:06,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:06,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 88 [2019-01-08 13:53:06,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:06,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-08 13:53:06,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-08 13:53:06,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3313, Invalid=4519, Unknown=0, NotChecked=0, Total=7832 [2019-01-08 13:53:06,657 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2019-01-08 13:53:07,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:07,804 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-01-08 13:53:07,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-08 13:53:07,805 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2019-01-08 13:53:07,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:07,806 INFO L225 Difference]: With dead ends: 151 [2019-01-08 13:53:07,806 INFO L226 Difference]: Without dead ends: 150 [2019-01-08 13:53:07,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4056 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5427, Invalid=8145, Unknown=0, NotChecked=0, Total=13572 [2019-01-08 13:53:07,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-08 13:53:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-01-08 13:53:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-08 13:53:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-01-08 13:53:07,827 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2019-01-08 13:53:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:07,827 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-01-08 13:53:07,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-08 13:53:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-01-08 13:53:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-08 13:53:07,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:07,828 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2019-01-08 13:53:07,828 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:07,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:07,829 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2019-01-08 13:53:07,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:07,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:07,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:07,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:07,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:08,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:08,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:08,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:08,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:08,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:08,477 INFO L193 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 [2019-01-08 13:53:08,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:08,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:08,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:08,593 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 6 treesize of output 5 [2019-01-08 13:53:08,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:08,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:08,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:09,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:10,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:10,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2019-01-08 13:53:10,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:10,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-08 13:53:10,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-08 13:53:10,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3547, Invalid=4825, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:53:10,902 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2019-01-08 13:53:12,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:12,142 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-01-08 13:53:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-08 13:53:12,143 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2019-01-08 13:53:12,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:12,144 INFO L225 Difference]: With dead ends: 156 [2019-01-08 13:53:12,144 INFO L226 Difference]: Without dead ends: 155 [2019-01-08 13:53:12,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5809, Invalid=8711, Unknown=0, NotChecked=0, Total=14520 [2019-01-08 13:53:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-08 13:53:12,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-01-08 13:53:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-08 13:53:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-01-08 13:53:12,166 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2019-01-08 13:53:12,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:12,166 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-01-08 13:53:12,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-08 13:53:12,166 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-01-08 13:53:12,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-08 13:53:12,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:12,167 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2019-01-08 13:53:12,167 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:12,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2019-01-08 13:53:12,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:12,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:12,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:13,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:13,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:13,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:13,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,185 INFO L193 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 [2019-01-08 13:53:13,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:13,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:13,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-08 13:53:13,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:13,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:13,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 6 treesize of output 5 [2019-01-08 13:53:13,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:13,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:13,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:14,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:14,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:16,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:16,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:16,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2019-01-08 13:53:16,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:16,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-08 13:53:16,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-08 13:53:16,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3789, Invalid=5141, Unknown=0, NotChecked=0, Total=8930 [2019-01-08 13:53:16,162 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2019-01-08 13:53:17,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:17,391 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-01-08 13:53:17,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-08 13:53:17,391 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2019-01-08 13:53:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:17,393 INFO L225 Difference]: With dead ends: 161 [2019-01-08 13:53:17,393 INFO L226 Difference]: Without dead ends: 160 [2019-01-08 13:53:17,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4646 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6204, Invalid=9296, Unknown=0, NotChecked=0, Total=15500 [2019-01-08 13:53:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-08 13:53:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-01-08 13:53:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-08 13:53:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-01-08 13:53:17,418 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2019-01-08 13:53:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:17,419 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-01-08 13:53:17,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-08 13:53:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-01-08 13:53:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-08 13:53:17,420 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:17,420 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2019-01-08 13:53:17,420 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:17,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:17,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2019-01-08 13:53:17,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:17,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:17,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:17,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:18,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:18,197 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:18,197 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:18,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:18,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:18,198 INFO L193 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 [2019-01-08 13:53:18,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:18,206 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:18,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:18,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:18,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:18,327 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 6 treesize of output 5 [2019-01-08 13:53:18,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:18,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:18,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:19,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:20,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:20,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:20,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 97 [2019-01-08 13:53:20,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:20,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-08 13:53:20,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-08 13:53:20,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4039, Invalid=5467, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 13:53:20,899 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2019-01-08 13:53:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:22,257 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-01-08 13:53:22,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-08 13:53:22,258 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2019-01-08 13:53:22,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:22,259 INFO L225 Difference]: With dead ends: 166 [2019-01-08 13:53:22,259 INFO L226 Difference]: Without dead ends: 165 [2019-01-08 13:53:22,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6612, Invalid=9900, Unknown=0, NotChecked=0, Total=16512 [2019-01-08 13:53:22,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-08 13:53:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-01-08 13:53:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-08 13:53:22,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-01-08 13:53:22,294 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2019-01-08 13:53:22,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:22,294 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-01-08 13:53:22,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-08 13:53:22,295 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-01-08 13:53:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-08 13:53:22,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:22,296 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2019-01-08 13:53:22,296 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:22,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:22,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2019-01-08 13:53:22,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:22,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:22,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:22,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:23,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:23,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:23,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:23,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:23,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:23,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:23,209 INFO L193 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 [2019-01-08 13:53:23,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:23,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:23,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:23,339 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 6 treesize of output 5 [2019-01-08 13:53:23,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:23,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:23,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:24,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:26,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:26,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 100 [2019-01-08 13:53:26,118 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:26,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-08 13:53:26,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-08 13:53:26,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4297, Invalid=5803, Unknown=0, NotChecked=0, Total=10100 [2019-01-08 13:53:26,120 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2019-01-08 13:53:27,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:27,588 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-01-08 13:53:27,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-08 13:53:27,589 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2019-01-08 13:53:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:27,590 INFO L225 Difference]: With dead ends: 171 [2019-01-08 13:53:27,590 INFO L226 Difference]: Without dead ends: 170 [2019-01-08 13:53:27,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5276 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7033, Invalid=10523, Unknown=0, NotChecked=0, Total=17556 [2019-01-08 13:53:27,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-08 13:53:27,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-01-08 13:53:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-08 13:53:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-01-08 13:53:27,632 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2019-01-08 13:53:27,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:27,633 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-01-08 13:53:27,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-08 13:53:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-01-08 13:53:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-08 13:53:27,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:27,634 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2019-01-08 13:53:27,634 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2019-01-08 13:53:27,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:27,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:27,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:27,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:27,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:28,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:28,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:28,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:28,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:28,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:28,850 INFO L193 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 [2019-01-08 13:53:28,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:28,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:29,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-08 13:53:29,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:29,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:29,069 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 6 treesize of output 5 [2019-01-08 13:53:29,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:29,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:29,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:29,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:29,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:31,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:31,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 103 [2019-01-08 13:53:31,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:31,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-08 13:53:31,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-08 13:53:31,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=6149, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:31,840 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2019-01-08 13:53:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:33,466 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-01-08 13:53:33,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-08 13:53:33,466 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2019-01-08 13:53:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:33,467 INFO L225 Difference]: With dead ends: 176 [2019-01-08 13:53:33,467 INFO L226 Difference]: Without dead ends: 175 [2019-01-08 13:53:33,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5606 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7467, Invalid=11165, Unknown=0, NotChecked=0, Total=18632 [2019-01-08 13:53:33,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-08 13:53:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-01-08 13:53:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-08 13:53:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-01-08 13:53:33,505 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2019-01-08 13:53:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:33,505 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-01-08 13:53:33,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-08 13:53:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-01-08 13:53:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-08 13:53:33,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:33,506 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2019-01-08 13:53:33,507 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2019-01-08 13:53:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:33,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:33,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:35,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:35,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:35,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:35,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:35,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:35,055 INFO L193 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 [2019-01-08 13:53:35,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:35,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:35,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:35,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:35,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:35,209 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 6 treesize of output 5 [2019-01-08 13:53:35,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:35,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:35,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:36,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:38,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:38,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 106 [2019-01-08 13:53:38,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:38,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-08 13:53:38,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-08 13:53:38,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4837, Invalid=6505, Unknown=0, NotChecked=0, Total=11342 [2019-01-08 13:53:38,169 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2019-01-08 13:53:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:39,782 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-01-08 13:53:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-08 13:53:39,783 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2019-01-08 13:53:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:39,784 INFO L225 Difference]: With dead ends: 181 [2019-01-08 13:53:39,784 INFO L226 Difference]: Without dead ends: 180 [2019-01-08 13:53:39,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5946 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7914, Invalid=11826, Unknown=0, NotChecked=0, Total=19740 [2019-01-08 13:53:39,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-08 13:53:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-01-08 13:53:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-08 13:53:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-01-08 13:53:39,822 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2019-01-08 13:53:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:39,822 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-01-08 13:53:39,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-08 13:53:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-01-08 13:53:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-08 13:53:39,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:39,824 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2019-01-08 13:53:39,824 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:39,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:39,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2019-01-08 13:53:39,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:39,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:39,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:39,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:39,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:40,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:40,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:40,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:40,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:40,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:40,953 INFO L193 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 [2019-01-08 13:53:40,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:40,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:41,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:41,103 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 6 treesize of output 5 [2019-01-08 13:53:41,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:41,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:41,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:42,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:44,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:44,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 109 [2019-01-08 13:53:44,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:44,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 13:53:44,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 13:53:44,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5119, Invalid=6871, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 13:53:44,026 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2019-01-08 13:53:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:45,995 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-01-08 13:53:45,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-08 13:53:45,995 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2019-01-08 13:53:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:45,996 INFO L225 Difference]: With dead ends: 186 [2019-01-08 13:53:45,996 INFO L226 Difference]: Without dead ends: 185 [2019-01-08 13:53:45,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6296 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=8374, Invalid=12506, Unknown=0, NotChecked=0, Total=20880 [2019-01-08 13:53:45,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-08 13:53:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-01-08 13:53:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-08 13:53:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-01-08 13:53:46,034 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2019-01-08 13:53:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:46,034 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-01-08 13:53:46,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 13:53:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-01-08 13:53:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-08 13:53:46,035 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:46,035 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2019-01-08 13:53:46,036 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:46,036 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2019-01-08 13:53:46,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:46,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:46,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:47,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:47,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:47,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:47,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:47,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:47,038 INFO L193 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 [2019-01-08 13:53:47,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:47,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:47,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-08 13:53:47,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:47,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:47,299 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 6 treesize of output 5 [2019-01-08 13:53:47,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:47,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:47,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:48,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:50,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:50,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:50,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 112 [2019-01-08 13:53:50,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:50,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-08 13:53:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-08 13:53:50,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5409, Invalid=7247, Unknown=0, NotChecked=0, Total=12656 [2019-01-08 13:53:50,268 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2019-01-08 13:53:52,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:52,175 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-01-08 13:53:52,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-08 13:53:52,177 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2019-01-08 13:53:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:52,178 INFO L225 Difference]: With dead ends: 191 [2019-01-08 13:53:52,179 INFO L226 Difference]: Without dead ends: 190 [2019-01-08 13:53:52,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8847, Invalid=13205, Unknown=0, NotChecked=0, Total=22052 [2019-01-08 13:53:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-08 13:53:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-01-08 13:53:52,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-08 13:53:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-01-08 13:53:52,213 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2019-01-08 13:53:52,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:52,214 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-01-08 13:53:52,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-08 13:53:52,214 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-01-08 13:53:52,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-08 13:53:52,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:52,214 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2019-01-08 13:53:52,215 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:52,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:52,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2019-01-08 13:53:52,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:52,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:52,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:52,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:52,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:53,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:53,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:53,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:53,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:53,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:53,563 INFO L193 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 [2019-01-08 13:53:53,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:53,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:53,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:53,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:53,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:53,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 6 treesize of output 5 [2019-01-08 13:53:53,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:53:53,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:53:53,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:53:55,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:55,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:57,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:57,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 115 [2019-01-08 13:53:57,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:57,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-08 13:53:57,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-08 13:53:57,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5707, Invalid=7633, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 13:53:57,898 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2019-01-08 13:53:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:59,743 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-01-08 13:53:59,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-08 13:53:59,743 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2019-01-08 13:53:59,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:59,744 INFO L225 Difference]: With dead ends: 196 [2019-01-08 13:53:59,744 INFO L226 Difference]: Without dead ends: 195 [2019-01-08 13:53:59,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9333, Invalid=13923, Unknown=0, NotChecked=0, Total=23256 [2019-01-08 13:53:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-08 13:53:59,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-01-08 13:53:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-08 13:53:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-01-08 13:53:59,784 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2019-01-08 13:53:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:59,784 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-01-08 13:53:59,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-08 13:53:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-01-08 13:53:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-08 13:53:59,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:59,785 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2019-01-08 13:53:59,785 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:53:59,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2019-01-08 13:53:59,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:59,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:59,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:59,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:59,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:00,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:00,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:00,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:00,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:00,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:00,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:00,858 INFO L193 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 [2019-01-08 13:54:00,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:00,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:00,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:01,010 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 6 treesize of output 5 [2019-01-08 13:54:01,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:01,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:01,019 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:02,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:04,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:04,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 118 [2019-01-08 13:54:04,298 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:04,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 13:54:04,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 13:54:04,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6013, Invalid=8029, Unknown=0, NotChecked=0, Total=14042 [2019-01-08 13:54:04,301 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2019-01-08 13:54:06,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:06,113 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-01-08 13:54:06,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-08 13:54:06,113 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2019-01-08 13:54:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:06,114 INFO L225 Difference]: With dead ends: 201 [2019-01-08 13:54:06,114 INFO L226 Difference]: Without dead ends: 200 [2019-01-08 13:54:06,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=9832, Invalid=14660, Unknown=0, NotChecked=0, Total=24492 [2019-01-08 13:54:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-08 13:54:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-01-08 13:54:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-08 13:54:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-01-08 13:54:06,162 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2019-01-08 13:54:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:06,162 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-01-08 13:54:06,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 13:54:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-01-08 13:54:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-08 13:54:06,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:06,164 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2019-01-08 13:54:06,164 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:54:06,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2019-01-08 13:54:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:06,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:06,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:06,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:06,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:07,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:07,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:07,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:07,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:07,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:07,214 INFO L193 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 [2019-01-08 13:54:07,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:07,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:07,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-08 13:54:07,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:07,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:07,468 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 6 treesize of output 5 [2019-01-08 13:54:07,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:07,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:07,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:08,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:10,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:10,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 121 [2019-01-08 13:54:10,697 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:10,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-08 13:54:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-08 13:54:10,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6327, Invalid=8435, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:54:10,698 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2019-01-08 13:54:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:12,712 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-01-08 13:54:12,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-08 13:54:12,713 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2019-01-08 13:54:12,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:12,714 INFO L225 Difference]: With dead ends: 206 [2019-01-08 13:54:12,714 INFO L226 Difference]: Without dead ends: 205 [2019-01-08 13:54:12,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7796 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=10344, Invalid=15416, Unknown=0, NotChecked=0, Total=25760 [2019-01-08 13:54:12,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-08 13:54:12,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-01-08 13:54:12,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-08 13:54:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-01-08 13:54:12,750 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2019-01-08 13:54:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:12,750 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-01-08 13:54:12,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-08 13:54:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-01-08 13:54:12,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-01-08 13:54:12,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:12,751 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2019-01-08 13:54:12,752 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:54:12,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:12,752 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2019-01-08 13:54:12,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:12,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:12,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:12,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:12,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:13,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:13,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:13,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:13,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:13,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:13,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:13,949 INFO L193 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 [2019-01-08 13:54:13,957 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:13,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:14,099 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:14,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:14,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:14,110 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 6 treesize of output 5 [2019-01-08 13:54:14,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:14,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:14,119 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:15,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:18,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:18,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 124 [2019-01-08 13:54:18,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:18,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-08 13:54:18,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-08 13:54:18,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6649, Invalid=8851, Unknown=0, NotChecked=0, Total=15500 [2019-01-08 13:54:18,349 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2019-01-08 13:54:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:20,409 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-01-08 13:54:20,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-08 13:54:20,409 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2019-01-08 13:54:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:20,410 INFO L225 Difference]: With dead ends: 211 [2019-01-08 13:54:20,411 INFO L226 Difference]: Without dead ends: 210 [2019-01-08 13:54:20,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8196 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10869, Invalid=16191, Unknown=0, NotChecked=0, Total=27060 [2019-01-08 13:54:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-08 13:54:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2019-01-08 13:54:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-08 13:54:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-01-08 13:54:20,448 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2019-01-08 13:54:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:20,448 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-01-08 13:54:20,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-08 13:54:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-01-08 13:54:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-08 13:54:20,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:20,449 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2019-01-08 13:54:20,449 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:54:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:20,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2019-01-08 13:54:20,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:20,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:20,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:21,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:21,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:21,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:21,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:21,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:21,681 INFO L193 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 [2019-01-08 13:54:21,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:21,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:21,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:21,851 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 6 treesize of output 5 [2019-01-08 13:54:21,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:21,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:21,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:23,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:25,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:25,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 127 [2019-01-08 13:54:25,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:25,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 13:54:25,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 13:54:25,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6979, Invalid=9277, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 13:54:25,574 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2019-01-08 13:54:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:27,804 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-01-08 13:54:27,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-08 13:54:27,804 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2019-01-08 13:54:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:27,805 INFO L225 Difference]: With dead ends: 216 [2019-01-08 13:54:27,805 INFO L226 Difference]: Without dead ends: 215 [2019-01-08 13:54:27,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8606 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=11407, Invalid=16985, Unknown=0, NotChecked=0, Total=28392 [2019-01-08 13:54:27,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-08 13:54:27,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-01-08 13:54:27,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-08 13:54:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-01-08 13:54:27,847 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2019-01-08 13:54:27,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:27,847 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-01-08 13:54:27,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 13:54:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-01-08 13:54:27,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-01-08 13:54:27,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:27,848 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2019-01-08 13:54:27,848 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:54:27,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:27,848 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2019-01-08 13:54:27,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:27,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:27,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:27,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:28,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:28,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:28,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:28,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:28,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:28,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:28,957 INFO L193 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 [2019-01-08 13:54:28,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:28,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:29,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-08 13:54:29,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:29,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:29,305 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 6 treesize of output 5 [2019-01-08 13:54:29,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:29,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:29,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:30,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:33,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:33,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:33,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 130 [2019-01-08 13:54:33,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:33,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-08 13:54:33,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-08 13:54:33,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7317, Invalid=9713, Unknown=0, NotChecked=0, Total=17030 [2019-01-08 13:54:33,285 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2019-01-08 13:54:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:35,334 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-01-08 13:54:35,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-08 13:54:35,334 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2019-01-08 13:54:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:35,335 INFO L225 Difference]: With dead ends: 221 [2019-01-08 13:54:35,335 INFO L226 Difference]: Without dead ends: 220 [2019-01-08 13:54:35,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9026 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=11958, Invalid=17798, Unknown=0, NotChecked=0, Total=29756 [2019-01-08 13:54:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-08 13:54:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-01-08 13:54:35,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-08 13:54:35,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-01-08 13:54:35,378 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2019-01-08 13:54:35,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:35,378 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-01-08 13:54:35,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-08 13:54:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-01-08 13:54:35,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-08 13:54:35,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:35,380 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2019-01-08 13:54:35,380 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:54:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:35,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2019-01-08 13:54:35,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:35,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:35,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:35,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:35,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:36,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:36,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:36,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:36,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:36,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:36,549 INFO L193 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 [2019-01-08 13:54:36,559 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:36,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:36,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:36,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:36,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:36,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 6 treesize of output 5 [2019-01-08 13:54:36,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:36,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:36,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:38,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:41,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:41,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 133 [2019-01-08 13:54:41,210 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:41,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-08 13:54:41,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-08 13:54:41,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7663, Invalid=10159, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:54:41,211 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2019-01-08 13:54:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:43,613 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-01-08 13:54:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-08 13:54:43,613 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2019-01-08 13:54:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:43,615 INFO L225 Difference]: With dead ends: 226 [2019-01-08 13:54:43,615 INFO L226 Difference]: Without dead ends: 225 [2019-01-08 13:54:43,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=12522, Invalid=18630, Unknown=0, NotChecked=0, Total=31152 [2019-01-08 13:54:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-01-08 13:54:43,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-01-08 13:54:43,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-08 13:54:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-01-08 13:54:43,658 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2019-01-08 13:54:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:43,659 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-01-08 13:54:43,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-08 13:54:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-01-08 13:54:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-01-08 13:54:43,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:43,660 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2019-01-08 13:54:43,660 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:54:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2019-01-08 13:54:43,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:43,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:43,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:43,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:43,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:45,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:45,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:45,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:45,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:45,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:45,016 INFO L193 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 [2019-01-08 13:54:45,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:45,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:45,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:45,196 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 6 treesize of output 5 [2019-01-08 13:54:45,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:45,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:45,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:46,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:49,594 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:49,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:49,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 136 [2019-01-08 13:54:49,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:49,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 13:54:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 13:54:49,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8017, Invalid=10615, Unknown=0, NotChecked=0, Total=18632 [2019-01-08 13:54:49,618 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2019-01-08 13:54:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:52,001 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-01-08 13:54:52,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-08 13:54:52,001 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2019-01-08 13:54:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:52,002 INFO L225 Difference]: With dead ends: 231 [2019-01-08 13:54:52,002 INFO L226 Difference]: Without dead ends: 230 [2019-01-08 13:54:52,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9896 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=13099, Invalid=19481, Unknown=0, NotChecked=0, Total=32580 [2019-01-08 13:54:52,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-08 13:54:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-08 13:54:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-08 13:54:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-01-08 13:54:52,064 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2019-01-08 13:54:52,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:52,064 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-01-08 13:54:52,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 13:54:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-01-08 13:54:52,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-08 13:54:52,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:52,066 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2019-01-08 13:54:52,066 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:54:52,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2019-01-08 13:54:52,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:52,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:52,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:53,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:53,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:53,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:53,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:53,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:53,598 INFO L193 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 [2019-01-08 13:54:53,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:53,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:53,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-08 13:54:53,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:53,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:53,908 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 6 treesize of output 5 [2019-01-08 13:54:53,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:54:53,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:54:53,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:54:55,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:55,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:58,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:58,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:58,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 139 [2019-01-08 13:54:58,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:58,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-08 13:54:58,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-08 13:54:58,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8379, Invalid=11081, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:54:58,572 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2019-01-08 13:55:00,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:00,932 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2019-01-08 13:55:00,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-08 13:55:00,933 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2019-01-08 13:55:00,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:00,934 INFO L225 Difference]: With dead ends: 236 [2019-01-08 13:55:00,934 INFO L226 Difference]: Without dead ends: 235 [2019-01-08 13:55:00,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10346 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=13689, Invalid=20351, Unknown=0, NotChecked=0, Total=34040 [2019-01-08 13:55:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-08 13:55:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-01-08 13:55:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-08 13:55:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-01-08 13:55:00,997 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2019-01-08 13:55:00,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:00,997 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-01-08 13:55:00,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-08 13:55:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-01-08 13:55:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-08 13:55:00,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:00,999 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2019-01-08 13:55:00,999 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:55:00,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:01,000 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2019-01-08 13:55:01,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:01,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:01,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:01,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:01,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:02,578 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:02,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:02,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:02,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:02,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:02,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:02,579 INFO L193 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 [2019-01-08 13:55:02,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:02,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:02,751 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:02,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:02,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:02,763 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 6 treesize of output 5 [2019-01-08 13:55:02,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:02,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:02,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:04,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:04,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:07,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:07,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 142 [2019-01-08 13:55:07,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:07,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-08 13:55:07,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-08 13:55:07,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8749, Invalid=11557, Unknown=0, NotChecked=0, Total=20306 [2019-01-08 13:55:07,330 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2019-01-08 13:55:10,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:10,120 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-01-08 13:55:10,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-08 13:55:10,121 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2019-01-08 13:55:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:10,122 INFO L225 Difference]: With dead ends: 241 [2019-01-08 13:55:10,122 INFO L226 Difference]: Without dead ends: 240 [2019-01-08 13:55:10,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10806 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=14292, Invalid=21240, Unknown=0, NotChecked=0, Total=35532 [2019-01-08 13:55:10,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-08 13:55:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2019-01-08 13:55:10,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-08 13:55:10,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-01-08 13:55:10,187 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2019-01-08 13:55:10,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:10,188 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-01-08 13:55:10,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-08 13:55:10,188 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-01-08 13:55:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-08 13:55:10,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:10,189 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2019-01-08 13:55:10,190 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:55:10,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2019-01-08 13:55:10,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:10,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:10,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:10,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:10,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:11,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:11,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:11,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:11,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:11,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:11,630 INFO L193 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 [2019-01-08 13:55:11,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:11,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:11,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:11,814 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 6 treesize of output 5 [2019-01-08 13:55:11,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:11,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:11,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:13,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:16,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:16,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 145 [2019-01-08 13:55:16,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:16,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-08 13:55:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-08 13:55:16,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9127, Invalid=12043, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 13:55:16,854 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2019-01-08 13:55:19,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:19,458 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-01-08 13:55:19,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-08 13:55:19,458 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2019-01-08 13:55:19,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:19,459 INFO L225 Difference]: With dead ends: 246 [2019-01-08 13:55:19,459 INFO L226 Difference]: Without dead ends: 245 [2019-01-08 13:55:19,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11276 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=14908, Invalid=22148, Unknown=0, NotChecked=0, Total=37056 [2019-01-08 13:55:19,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-08 13:55:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-01-08 13:55:19,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-08 13:55:19,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-01-08 13:55:19,507 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2019-01-08 13:55:19,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:19,508 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2019-01-08 13:55:19,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-08 13:55:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2019-01-08 13:55:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-08 13:55:19,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:19,509 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2019-01-08 13:55:19,509 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:55:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2019-01-08 13:55:19,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:19,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:19,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:19,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:19,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:20,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:20,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:20,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:20,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:20,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:20,914 INFO L193 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 [2019-01-08 13:55:20,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:20,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:21,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-08 13:55:21,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:21,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:21,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 6 treesize of output 5 [2019-01-08 13:55:21,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:21,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:21,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:22,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:22,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:26,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:26,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:26,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 148 [2019-01-08 13:55:26,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:26,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-08 13:55:26,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-08 13:55:26,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9513, Invalid=12539, Unknown=0, NotChecked=0, Total=22052 [2019-01-08 13:55:26,385 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2019-01-08 13:55:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:29,041 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-01-08 13:55:29,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-08 13:55:29,041 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2019-01-08 13:55:29,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:29,042 INFO L225 Difference]: With dead ends: 251 [2019-01-08 13:55:29,043 INFO L226 Difference]: Without dead ends: 250 [2019-01-08 13:55:29,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11756 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=15537, Invalid=23075, Unknown=0, NotChecked=0, Total=38612 [2019-01-08 13:55:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-08 13:55:29,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2019-01-08 13:55:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-08 13:55:29,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-01-08 13:55:29,098 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2019-01-08 13:55:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:29,099 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-01-08 13:55:29,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-08 13:55:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-01-08 13:55:29,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-08 13:55:29,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:29,100 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2019-01-08 13:55:29,100 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:55:29,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:29,101 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2019-01-08 13:55:29,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:29,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:29,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:29,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:29,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:30,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:30,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:30,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:30,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:30,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:30,894 INFO L193 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 [2019-01-08 13:55:30,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:30,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:31,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:31,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:31,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:31,088 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 6 treesize of output 5 [2019-01-08 13:55:31,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:31,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:31,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:32,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:36,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:36,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:36,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-01-08 13:55:36,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:36,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-08 13:55:36,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-08 13:55:36,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9907, Invalid=13045, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 13:55:36,419 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2019-01-08 13:55:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:39,219 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2019-01-08 13:55:39,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-08 13:55:39,219 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2019-01-08 13:55:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:39,221 INFO L225 Difference]: With dead ends: 256 [2019-01-08 13:55:39,221 INFO L226 Difference]: Without dead ends: 255 [2019-01-08 13:55:39,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12246 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=16179, Invalid=24021, Unknown=0, NotChecked=0, Total=40200 [2019-01-08 13:55:39,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-01-08 13:55:39,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-01-08 13:55:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-08 13:55:39,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-01-08 13:55:39,282 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2019-01-08 13:55:39,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:39,282 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-01-08 13:55:39,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-08 13:55:39,283 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-01-08 13:55:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-01-08 13:55:39,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:39,284 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2019-01-08 13:55:39,284 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:55:39,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2019-01-08 13:55:39,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:39,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:39,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:39,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:40,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:40,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:40,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:40,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:40,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:40,733 INFO L193 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 [2019-01-08 13:55:40,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:40,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:40,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:40,966 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 6 treesize of output 5 [2019-01-08 13:55:40,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:40,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:40,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:42,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:46,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:46,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-08 13:55:46,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:46,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-08 13:55:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-08 13:55:46,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10309, Invalid=13561, Unknown=0, NotChecked=0, Total=23870 [2019-01-08 13:55:46,386 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2019-01-08 13:55:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:49,433 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-01-08 13:55:49,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-08 13:55:49,434 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2019-01-08 13:55:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:49,435 INFO L225 Difference]: With dead ends: 261 [2019-01-08 13:55:49,435 INFO L226 Difference]: Without dead ends: 260 [2019-01-08 13:55:49,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12746 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=16834, Invalid=24986, Unknown=0, NotChecked=0, Total=41820 [2019-01-08 13:55:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-08 13:55:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2019-01-08 13:55:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-08 13:55:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-01-08 13:55:49,505 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2019-01-08 13:55:49,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:49,505 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-01-08 13:55:49,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-08 13:55:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-01-08 13:55:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-08 13:55:49,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:49,507 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2019-01-08 13:55:49,507 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:55:49,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2019-01-08 13:55:49,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:49,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:49,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:49,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:49,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:51,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:51,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:51,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:51,009 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:51,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:51,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:51,009 INFO L193 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 [2019-01-08 13:55:51,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:51,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:51,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-08 13:55:51,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:51,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:51,407 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 6 treesize of output 5 [2019-01-08 13:55:51,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:55:51,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:55:51,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:55:53,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:53,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:57,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:57,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-08 13:55:57,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:57,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-08 13:55:57,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-08 13:55:57,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10412, Invalid=13768, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 13:55:57,098 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2019-01-08 13:56:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:00,178 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-01-08 13:56:00,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-08 13:56:00,179 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2019-01-08 13:56:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:00,180 INFO L225 Difference]: With dead ends: 266 [2019-01-08 13:56:00,180 INFO L226 Difference]: Without dead ends: 265 [2019-01-08 13:56:00,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13347 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=17093, Invalid=25549, Unknown=0, NotChecked=0, Total=42642 [2019-01-08 13:56:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-08 13:56:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2019-01-08 13:56:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-08 13:56:00,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-01-08 13:56:00,236 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2019-01-08 13:56:00,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:00,237 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-01-08 13:56:00,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-08 13:56:00,237 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-01-08 13:56:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-08 13:56:00,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:00,238 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2019-01-08 13:56:00,238 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:56:00,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:00,238 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2019-01-08 13:56:00,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:00,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:00,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:00,239 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:01,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:01,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:01,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:01,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:01,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:01,842 INFO L193 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 [2019-01-08 13:56:01,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:01,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:02,032 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:02,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:02,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:02,044 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 6 treesize of output 5 [2019-01-08 13:56:02,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:02,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:02,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:03,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:07,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:07,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-08 13:56:07,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:07,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-08 13:56:07,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-08 13:56:07,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10515, Invalid=13977, Unknown=0, NotChecked=0, Total=24492 [2019-01-08 13:56:07,748 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2019-01-08 13:56:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:10,895 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-01-08 13:56:10,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-08 13:56:10,895 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2019-01-08 13:56:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:10,896 INFO L225 Difference]: With dead ends: 271 [2019-01-08 13:56:10,896 INFO L226 Difference]: Without dead ends: 270 [2019-01-08 13:56:10,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 415 SyntacticMatches, 4 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13950 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=17353, Invalid=26119, Unknown=0, NotChecked=0, Total=43472 [2019-01-08 13:56:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-08 13:56:10,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-01-08 13:56:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-01-08 13:56:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-01-08 13:56:10,956 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2019-01-08 13:56:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:10,956 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-01-08 13:56:10,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-08 13:56:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-01-08 13:56:10,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-01-08 13:56:10,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:10,957 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2019-01-08 13:56:10,957 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:56:10,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2019-01-08 13:56:10,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:10,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:10,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:12,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:12,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:12,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:12,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:12,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:12,575 INFO L193 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 [2019-01-08 13:56:12,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:12,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:12,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:12,767 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 6 treesize of output 5 [2019-01-08 13:56:12,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:12,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:12,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:14,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:18,598 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:18,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:18,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-08 13:56:18,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:18,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-08 13:56:18,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-08 13:56:18,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10618, Invalid=14188, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 13:56:18,622 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2019-01-08 13:56:21,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:21,870 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-01-08 13:56:21,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-08 13:56:21,870 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2019-01-08 13:56:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:21,871 INFO L225 Difference]: With dead ends: 276 [2019-01-08 13:56:21,871 INFO L226 Difference]: Without dead ends: 275 [2019-01-08 13:56:21,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 423 SyntacticMatches, 6 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14555 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=17614, Invalid=26696, Unknown=0, NotChecked=0, Total=44310 [2019-01-08 13:56:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-08 13:56:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2019-01-08 13:56:21,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-01-08 13:56:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2019-01-08 13:56:21,956 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2019-01-08 13:56:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:21,957 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2019-01-08 13:56:21,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-08 13:56:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2019-01-08 13:56:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-01-08 13:56:21,958 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:21,959 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2019-01-08 13:56:21,959 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:56:21,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:21,959 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2019-01-08 13:56:21,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:21,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:21,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:21,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:23,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:23,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:23,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:23,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:23,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:23,581 INFO L193 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 [2019-01-08 13:56:23,590 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:23,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:24,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-08 13:56:24,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:24,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:24,015 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 6 treesize of output 5 [2019-01-08 13:56:24,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:24,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:24,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:26,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:26,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:30,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:30,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-08 13:56:30,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:30,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-08 13:56:30,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-08 13:56:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10721, Invalid=14401, Unknown=0, NotChecked=0, Total=25122 [2019-01-08 13:56:30,255 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2019-01-08 13:56:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:33,477 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-01-08 13:56:33,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-08 13:56:33,478 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2019-01-08 13:56:33,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:33,479 INFO L225 Difference]: With dead ends: 281 [2019-01-08 13:56:33,479 INFO L226 Difference]: Without dead ends: 280 [2019-01-08 13:56:33,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 431 SyntacticMatches, 8 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15162 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=17876, Invalid=27280, Unknown=0, NotChecked=0, Total=45156 [2019-01-08 13:56:33,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-08 13:56:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2019-01-08 13:56:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-08 13:56:33,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-01-08 13:56:33,558 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2019-01-08 13:56:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:33,559 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-01-08 13:56:33,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-08 13:56:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-01-08 13:56:33,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-01-08 13:56:33,560 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:33,560 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2019-01-08 13:56:33,561 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:56:33,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:33,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2019-01-08 13:56:33,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:33,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:33,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:33,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:35,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:35,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:35,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:35,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:35,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:35,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:35,512 INFO L193 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 [2019-01-08 13:56:35,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:35,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:35,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:35,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:35,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:35,733 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 6 treesize of output 5 [2019-01-08 13:56:35,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:35,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:35,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:37,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:37,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:41,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:41,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-08 13:56:41,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:41,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-08 13:56:41,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-08 13:56:41,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10824, Invalid=14616, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 13:56:41,807 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2019-01-08 13:56:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:45,349 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2019-01-08 13:56:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-08 13:56:45,349 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2019-01-08 13:56:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:45,350 INFO L225 Difference]: With dead ends: 286 [2019-01-08 13:56:45,350 INFO L226 Difference]: Without dead ends: 285 [2019-01-08 13:56:45,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 439 SyntacticMatches, 10 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15771 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=18139, Invalid=27871, Unknown=0, NotChecked=0, Total=46010 [2019-01-08 13:56:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-01-08 13:56:45,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-01-08 13:56:45,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-08 13:56:45,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2019-01-08 13:56:45,415 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2019-01-08 13:56:45,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:45,415 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2019-01-08 13:56:45,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-08 13:56:45,416 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2019-01-08 13:56:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-01-08 13:56:45,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:45,417 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2019-01-08 13:56:45,417 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:56:45,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:45,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2019-01-08 13:56:45,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:45,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:45,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:45,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:45,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:47,181 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:47,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:47,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:47,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:47,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:47,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:47,182 INFO L193 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 [2019-01-08 13:56:47,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:47,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:47,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:47,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:47,389 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 6 treesize of output 5 [2019-01-08 13:56:47,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:47,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:47,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:56:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:49,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:53,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:53,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-08 13:56:53,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:53,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-08 13:56:53,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-08 13:56:53,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10927, Invalid=14833, Unknown=0, NotChecked=0, Total=25760 [2019-01-08 13:56:53,671 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2019-01-08 13:56:57,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:57,285 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-01-08 13:56:57,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-08 13:56:57,285 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2019-01-08 13:56:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:57,287 INFO L225 Difference]: With dead ends: 291 [2019-01-08 13:56:57,287 INFO L226 Difference]: Without dead ends: 290 [2019-01-08 13:56:57,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 447 SyntacticMatches, 12 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16382 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=18403, Invalid=28469, Unknown=0, NotChecked=0, Total=46872 [2019-01-08 13:56:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-08 13:56:57,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-01-08 13:56:57,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-08 13:56:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-01-08 13:56:57,355 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2019-01-08 13:56:57,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:57,355 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-01-08 13:56:57,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-08 13:56:57,356 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-01-08 13:56:57,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-08 13:56:57,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:57,357 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2019-01-08 13:56:57,357 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:56:57,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:57,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2019-01-08 13:56:57,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:57,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:57,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:57,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:57,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:59,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:59,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:59,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:59,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:59,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:59,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:59,223 INFO L193 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 [2019-01-08 13:56:59,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:59,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:59,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-08 13:56:59,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:59,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:59,704 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 6 treesize of output 5 [2019-01-08 13:56:59,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:56:59,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:56:59,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:02,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:06,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:06,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-08 13:57:06,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:06,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-08 13:57:06,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-08 13:57:06,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11030, Invalid=15052, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 13:57:06,075 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2019-01-08 13:57:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:09,648 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2019-01-08 13:57:09,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-08 13:57:09,649 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2019-01-08 13:57:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:09,650 INFO L225 Difference]: With dead ends: 296 [2019-01-08 13:57:09,650 INFO L226 Difference]: Without dead ends: 295 [2019-01-08 13:57:09,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 455 SyntacticMatches, 14 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16995 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=18668, Invalid=29074, Unknown=0, NotChecked=0, Total=47742 [2019-01-08 13:57:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-01-08 13:57:09,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2019-01-08 13:57:09,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-08 13:57:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-01-08 13:57:09,718 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2019-01-08 13:57:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:09,718 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-01-08 13:57:09,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-08 13:57:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-01-08 13:57:09,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-01-08 13:57:09,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:09,720 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2019-01-08 13:57:09,720 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:57:09,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:09,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2019-01-08 13:57:09,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:09,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:09,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:09,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:09,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:11,952 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:11,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:11,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:11,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:11,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:11,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:11,953 INFO L193 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 [2019-01-08 13:57:11,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:11,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:12,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:12,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:12,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:12,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 6 treesize of output 5 [2019-01-08 13:57:12,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:57:12,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:57:12,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:14,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:18,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:18,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-08 13:57:18,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-08 13:57:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-08 13:57:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11133, Invalid=15273, Unknown=0, NotChecked=0, Total=26406 [2019-01-08 13:57:18,631 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2019-01-08 13:57:22,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:22,255 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-01-08 13:57:22,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-08 13:57:22,255 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2019-01-08 13:57:22,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:22,257 INFO L225 Difference]: With dead ends: 301 [2019-01-08 13:57:22,257 INFO L226 Difference]: Without dead ends: 300 [2019-01-08 13:57:22,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 463 SyntacticMatches, 16 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17610 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=18934, Invalid=29686, Unknown=0, NotChecked=0, Total=48620 [2019-01-08 13:57:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-08 13:57:22,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-01-08 13:57:22,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-08 13:57:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-01-08 13:57:22,339 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2019-01-08 13:57:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:22,339 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-01-08 13:57:22,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-08 13:57:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-01-08 13:57:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-08 13:57:22,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:22,341 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2019-01-08 13:57:22,341 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:57:22,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:22,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2019-01-08 13:57:22,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:22,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:22,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:22,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:22,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:24,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:24,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:24,294 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:24,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:24,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:24,294 INFO L193 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 [2019-01-08 13:57:24,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:24,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:57:24,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:24,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:24,517 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 6 treesize of output 5 [2019-01-08 13:57:24,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:57:24,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:57:24,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:27,022 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:27,022 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:30,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:31,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:31,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-08 13:57:31,005 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:31,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-08 13:57:31,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-08 13:57:31,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11236, Invalid=15496, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:57:31,007 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2019-01-08 13:57:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:34,604 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-01-08 13:57:34,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-08 13:57:34,605 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2019-01-08 13:57:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:34,606 INFO L225 Difference]: With dead ends: 306 [2019-01-08 13:57:34,606 INFO L226 Difference]: Without dead ends: 305 [2019-01-08 13:57:34,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 471 SyntacticMatches, 18 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18227 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=19201, Invalid=30305, Unknown=0, NotChecked=0, Total=49506 [2019-01-08 13:57:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-08 13:57:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2019-01-08 13:57:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-01-08 13:57:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-01-08 13:57:34,690 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2019-01-08 13:57:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:34,690 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2019-01-08 13:57:34,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-08 13:57:34,690 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2019-01-08 13:57:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-08 13:57:34,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:34,691 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2019-01-08 13:57:34,692 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:57:34,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:34,692 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2019-01-08 13:57:34,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:34,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:34,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:34,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:36,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:36,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:36,989 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:36,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:36,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:36,989 INFO L193 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 [2019-01-08 13:57:36,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:36,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:37,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-08 13:57:37,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:37,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:37,558 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 6 treesize of output 5 [2019-01-08 13:57:37,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:57:37,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:57:37,573 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:39,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:44,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:44,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-08 13:57:44,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:44,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-08 13:57:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-08 13:57:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11339, Invalid=15721, Unknown=0, NotChecked=0, Total=27060 [2019-01-08 13:57:44,085 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2019-01-08 13:57:48,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:48,014 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-01-08 13:57:48,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-08 13:57:48,017 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2019-01-08 13:57:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:48,018 INFO L225 Difference]: With dead ends: 311 [2019-01-08 13:57:48,019 INFO L226 Difference]: Without dead ends: 310 [2019-01-08 13:57:48,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 479 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=19469, Invalid=30931, Unknown=0, NotChecked=0, Total=50400 [2019-01-08 13:57:48,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-08 13:57:48,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-01-08 13:57:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-01-08 13:57:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-01-08 13:57:48,099 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2019-01-08 13:57:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:48,099 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-01-08 13:57:48,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-08 13:57:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-01-08 13:57:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-01-08 13:57:48,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:48,101 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2019-01-08 13:57:48,101 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:57:48,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:48,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2019-01-08 13:57:48,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:48,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:48,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:48,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:48,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:50,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:50,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:50,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:50,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:50,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:50,215 INFO L193 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 [2019-01-08 13:57:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:50,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:50,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:50,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:50,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:50,446 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 6 treesize of output 5 [2019-01-08 13:57:50,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:57:50,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:57:50,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:57:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:53,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:57,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:57,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-08 13:57:57,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:57,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-08 13:57:57,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-08 13:57:57,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11442, Invalid=15948, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 13:57:57,437 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 126 states. [2019-01-08 13:58:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:01,318 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2019-01-08 13:58:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-08 13:58:01,318 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 306 [2019-01-08 13:58:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:01,320 INFO L225 Difference]: With dead ends: 316 [2019-01-08 13:58:01,320 INFO L226 Difference]: Without dead ends: 315 [2019-01-08 13:58:01,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 487 SyntacticMatches, 22 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19467 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=19738, Invalid=31564, Unknown=0, NotChecked=0, Total=51302 [2019-01-08 13:58:01,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-08 13:58:01,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-01-08 13:58:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-08 13:58:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2019-01-08 13:58:01,407 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 306 [2019-01-08 13:58:01,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:01,407 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2019-01-08 13:58:01,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-08 13:58:01,407 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2019-01-08 13:58:01,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-01-08 13:58:01,408 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:01,408 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1, 1] [2019-01-08 13:58:01,408 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:58:01,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:01,409 INFO L82 PathProgramCache]: Analyzing trace with hash -291628847, now seen corresponding path program 61 times [2019-01-08 13:58:01,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:01,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:01,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:01,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:03,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:03,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:03,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:03,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:03,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:03,797 INFO L193 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 [2019-01-08 13:58:03,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:03,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:58:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:04,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:04,021 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 6 treesize of output 5 [2019-01-08 13:58:04,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:58:04,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:58:04,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:58:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:06,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:10,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:10,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-08 13:58:10,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:10,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-08 13:58:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-08 13:58:10,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11545, Invalid=16177, Unknown=0, NotChecked=0, Total=27722 [2019-01-08 13:58:10,891 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 128 states. [2019-01-08 13:58:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:14,975 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-01-08 13:58:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-08 13:58:14,976 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 311 [2019-01-08 13:58:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:14,977 INFO L225 Difference]: With dead ends: 321 [2019-01-08 13:58:14,977 INFO L226 Difference]: Without dead ends: 320 [2019-01-08 13:58:14,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 495 SyntacticMatches, 24 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20090 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20008, Invalid=32204, Unknown=0, NotChecked=0, Total=52212 [2019-01-08 13:58:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-01-08 13:58:15,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2019-01-08 13:58:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-08 13:58:15,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-01-08 13:58:15,062 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 311 [2019-01-08 13:58:15,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:15,062 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-01-08 13:58:15,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-08 13:58:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-01-08 13:58:15,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-08 13:58:15,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:15,064 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1, 1] [2019-01-08 13:58:15,065 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:58:15,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:15,065 INFO L82 PathProgramCache]: Analyzing trace with hash -537565849, now seen corresponding path program 62 times [2019-01-08 13:58:15,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:15,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:15,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:15,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:15,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:17,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:17,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:17,568 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:17,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:17,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:17,568 INFO L193 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 [2019-01-08 13:58:17,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:58:17,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:58:18,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-08 13:58:18,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:18,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:18,170 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 6 treesize of output 5 [2019-01-08 13:58:18,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:58:18,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:58:18,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:58:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:20,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:25,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:25,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:25,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-08 13:58:25,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:25,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-08 13:58:25,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-08 13:58:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11648, Invalid=16408, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 13:58:25,149 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 130 states. [2019-01-08 13:58:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:29,574 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2019-01-08 13:58:29,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-08 13:58:29,575 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 316 [2019-01-08 13:58:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:29,576 INFO L225 Difference]: With dead ends: 326 [2019-01-08 13:58:29,576 INFO L226 Difference]: Without dead ends: 325 [2019-01-08 13:58:29,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 503 SyntacticMatches, 26 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20715 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=20279, Invalid=32851, Unknown=0, NotChecked=0, Total=53130 [2019-01-08 13:58:29,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-08 13:58:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2019-01-08 13:58:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-08 13:58:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2019-01-08 13:58:29,668 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 316 [2019-01-08 13:58:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:29,669 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2019-01-08 13:58:29,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-08 13:58:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2019-01-08 13:58:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-08 13:58:29,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:29,670 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1, 1] [2019-01-08 13:58:29,671 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:58:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:29,671 INFO L82 PathProgramCache]: Analyzing trace with hash -582711663, now seen corresponding path program 63 times [2019-01-08 13:58:29,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:29,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:29,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:29,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:29,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:31,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:31,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:31,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:31,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:31,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:31,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:31,980 INFO L193 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 [2019-01-08 13:58:31,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:58:31,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:58:32,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:58:32,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:32,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:32,237 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 6 treesize of output 5 [2019-01-08 13:58:32,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:58:32,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:58:32,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:58:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:35,321 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:39,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:39,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-08 13:58:39,732 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:39,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-08 13:58:39,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-08 13:58:39,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11751, Invalid=16641, Unknown=0, NotChecked=0, Total=28392 [2019-01-08 13:58:39,734 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 132 states. [2019-01-08 13:58:44,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:44,021 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-01-08 13:58:44,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-08 13:58:44,021 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 321 [2019-01-08 13:58:44,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:44,023 INFO L225 Difference]: With dead ends: 331 [2019-01-08 13:58:44,023 INFO L226 Difference]: Without dead ends: 330 [2019-01-08 13:58:44,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 511 SyntacticMatches, 28 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21342 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20551, Invalid=33505, Unknown=0, NotChecked=0, Total=54056 [2019-01-08 13:58:44,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-08 13:58:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2019-01-08 13:58:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-01-08 13:58:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-01-08 13:58:44,108 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 321 [2019-01-08 13:58:44,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:44,108 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-01-08 13:58:44,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-08 13:58:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-01-08 13:58:44,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-08 13:58:44,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:44,109 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1, 1] [2019-01-08 13:58:44,110 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:58:44,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:44,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1894616999, now seen corresponding path program 64 times [2019-01-08 13:58:44,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:44,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:44,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:44,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:46,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:46,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:46,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:46,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:46,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:46,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:46,504 INFO L193 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 [2019-01-08 13:58:46,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:46,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:58:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:46,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:46,747 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 6 treesize of output 5 [2019-01-08 13:58:46,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:58:46,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:58:46,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:58:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:49,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:54,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:54,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-08 13:58:54,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:54,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-08 13:58:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-08 13:58:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11854, Invalid=16876, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 13:58:54,217 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 134 states. [2019-01-08 13:58:58,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:58,730 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2019-01-08 13:58:58,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-08 13:58:58,730 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 326 [2019-01-08 13:58:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:58,732 INFO L225 Difference]: With dead ends: 336 [2019-01-08 13:58:58,732 INFO L226 Difference]: Without dead ends: 335 [2019-01-08 13:58:58,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 519 SyntacticMatches, 30 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21971 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=20824, Invalid=34166, Unknown=0, NotChecked=0, Total=54990 [2019-01-08 13:58:58,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-08 13:58:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2019-01-08 13:58:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-01-08 13:58:58,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2019-01-08 13:58:58,823 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 326 [2019-01-08 13:58:58,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:58,824 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2019-01-08 13:58:58,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-08 13:58:58,824 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2019-01-08 13:58:58,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-01-08 13:58:58,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:58,825 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1, 1] [2019-01-08 13:58:58,825 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:58:58,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:58,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1074578513, now seen corresponding path program 65 times [2019-01-08 13:58:58,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:58,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:58,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:58,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:01,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:01,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:01,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:01,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:01,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:01,154 INFO L193 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 [2019-01-08 13:59:01,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:59:01,163 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:59:01,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-08 13:59:01,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:01,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:01,747 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 6 treesize of output 5 [2019-01-08 13:59:01,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:59:01,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:59:01,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:59:04,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:04,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:09,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:09,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-08 13:59:09,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:09,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-08 13:59:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-08 13:59:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11957, Invalid=17113, Unknown=0, NotChecked=0, Total=29070 [2019-01-08 13:59:09,366 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 136 states. [2019-01-08 13:59:14,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:14,114 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-01-08 13:59:14,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-08 13:59:14,115 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 331 [2019-01-08 13:59:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:14,116 INFO L225 Difference]: With dead ends: 341 [2019-01-08 13:59:14,116 INFO L226 Difference]: Without dead ends: 340 [2019-01-08 13:59:14,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 527 SyntacticMatches, 32 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22602 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21098, Invalid=34834, Unknown=0, NotChecked=0, Total=55932 [2019-01-08 13:59:14,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-01-08 13:59:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2019-01-08 13:59:14,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-01-08 13:59:14,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-01-08 13:59:14,211 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 331 [2019-01-08 13:59:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:14,212 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-01-08 13:59:14,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-08 13:59:14,212 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-01-08 13:59:14,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-08 13:59:14,213 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:14,213 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1, 1] [2019-01-08 13:59:14,213 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:59:14,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:14,214 INFO L82 PathProgramCache]: Analyzing trace with hash -362419737, now seen corresponding path program 66 times [2019-01-08 13:59:14,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:14,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:14,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:14,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:14,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:16,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:16,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:16,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:16,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:16,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:16,627 INFO L193 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 [2019-01-08 13:59:16,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:59:16,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:59:16,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:59:16,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:16,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:16,892 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 6 treesize of output 5 [2019-01-08 13:59:16,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:59:16,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:59:16,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:59:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:20,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:24,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:24,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-08 13:59:24,846 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:24,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-08 13:59:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-08 13:59:24,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12060, Invalid=17352, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 13:59:24,848 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 138 states. [2019-01-08 13:59:29,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:29,556 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2019-01-08 13:59:29,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-08 13:59:29,557 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 336 [2019-01-08 13:59:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:29,558 INFO L225 Difference]: With dead ends: 346 [2019-01-08 13:59:29,558 INFO L226 Difference]: Without dead ends: 345 [2019-01-08 13:59:29,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 535 SyntacticMatches, 34 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23235 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=21373, Invalid=35509, Unknown=0, NotChecked=0, Total=56882 [2019-01-08 13:59:29,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-08 13:59:29,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2019-01-08 13:59:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-08 13:59:29,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2019-01-08 13:59:29,668 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 336 [2019-01-08 13:59:29,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:29,669 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2019-01-08 13:59:29,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-08 13:59:29,669 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2019-01-08 13:59:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-01-08 13:59:29,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:29,670 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1, 1] [2019-01-08 13:59:29,670 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:59:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:29,671 INFO L82 PathProgramCache]: Analyzing trace with hash -218967535, now seen corresponding path program 67 times [2019-01-08 13:59:29,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:29,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:29,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:29,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:29,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:32,223 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:32,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:32,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:32,224 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:32,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:32,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:32,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:32,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:32,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:59:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:32,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:32,468 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 6 treesize of output 5 [2019-01-08 13:59:32,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:59:32,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:59:32,476 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:59:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:35,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:40,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:40,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-08 13:59:40,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:40,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-08 13:59:40,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-08 13:59:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12163, Invalid=17593, Unknown=0, NotChecked=0, Total=29756 [2019-01-08 13:59:40,256 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 140 states. [2019-01-08 13:59:45,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:45,131 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-01-08 13:59:45,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 13:59:45,131 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 341 [2019-01-08 13:59:45,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:45,133 INFO L225 Difference]: With dead ends: 351 [2019-01-08 13:59:45,133 INFO L226 Difference]: Without dead ends: 350 [2019-01-08 13:59:45,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 818 GetRequests, 543 SyntacticMatches, 36 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23870 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=21649, Invalid=36191, Unknown=0, NotChecked=0, Total=57840 [2019-01-08 13:59:45,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-08 13:59:45,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-01-08 13:59:45,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-01-08 13:59:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-01-08 13:59:45,233 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 341 [2019-01-08 13:59:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:45,233 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-01-08 13:59:45,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-08 13:59:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-01-08 13:59:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-01-08 13:59:45,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:45,235 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1, 1] [2019-01-08 13:59:45,235 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 13:59:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:45,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1914538969, now seen corresponding path program 68 times [2019-01-08 13:59:45,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:45,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:45,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:45,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:45,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:47,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:47,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:47,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:47,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:47,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:47,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:47,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:59:47,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:59:48,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-08 13:59:48,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:48,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:48,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 6 treesize of output 5 [2019-01-08 13:59:48,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 13:59:48,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 13:59:48,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 13:59:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:51,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:56,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:56,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-08 13:59:56,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:56,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-08 13:59:56,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-08 13:59:56,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12266, Invalid=17836, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 13:59:56,366 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 142 states. [2019-01-08 14:00:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:01,383 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2019-01-08 14:00:01,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-08 14:00:01,383 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 346 [2019-01-08 14:00:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:01,385 INFO L225 Difference]: With dead ends: 356 [2019-01-08 14:00:01,385 INFO L226 Difference]: Without dead ends: 355 [2019-01-08 14:00:01,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 551 SyntacticMatches, 38 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24507 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=21926, Invalid=36880, Unknown=0, NotChecked=0, Total=58806 [2019-01-08 14:00:01,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-01-08 14:00:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-01-08 14:00:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-01-08 14:00:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2019-01-08 14:00:01,491 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 346 [2019-01-08 14:00:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:01,492 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2019-01-08 14:00:01,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-08 14:00:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2019-01-08 14:00:01,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-01-08 14:00:01,493 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:01,493 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1, 1] [2019-01-08 14:00:01,493 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:00:01,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:01,494 INFO L82 PathProgramCache]: Analyzing trace with hash 116568017, now seen corresponding path program 69 times [2019-01-08 14:00:01,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:01,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:01,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:01,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:01,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:04,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:04,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:04,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:04,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:04,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:04,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:00:04,173 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:00:04,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:00:04,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:04,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:04,444 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 6 treesize of output 5 [2019-01-08 14:00:04,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:00:04,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:00:04,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:00:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:07,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:12,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:12,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-08 14:00:12,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:12,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-08 14:00:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-08 14:00:12,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12369, Invalid=18081, Unknown=0, NotChecked=0, Total=30450 [2019-01-08 14:00:12,454 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 144 states. [2019-01-08 14:00:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:17,570 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-01-08 14:00:17,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-08 14:00:17,570 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 351 [2019-01-08 14:00:17,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:17,571 INFO L225 Difference]: With dead ends: 361 [2019-01-08 14:00:17,572 INFO L226 Difference]: Without dead ends: 360 [2019-01-08 14:00:17,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 559 SyntacticMatches, 40 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25146 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22204, Invalid=37576, Unknown=0, NotChecked=0, Total=59780 [2019-01-08 14:00:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-01-08 14:00:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2019-01-08 14:00:17,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-08 14:00:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-01-08 14:00:17,678 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 351 [2019-01-08 14:00:17,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:17,678 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-01-08 14:00:17,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-08 14:00:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-01-08 14:00:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-01-08 14:00:17,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:17,680 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1, 1] [2019-01-08 14:00:17,680 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:00:17,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:17,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2014892441, now seen corresponding path program 70 times [2019-01-08 14:00:17,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:17,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:17,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:17,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:20,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:20,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:20,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:20,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:20,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:20,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:20,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:20,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:00:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:20,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:21,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 6 treesize of output 5 [2019-01-08 14:00:21,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:00:21,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:00:21,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:00:24,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:24,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:28,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:28,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-08 14:00:28,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:28,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-08 14:00:28,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-08 14:00:28,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12472, Invalid=18328, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 14:00:28,893 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 146 states. [2019-01-08 14:00:34,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:34,095 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2019-01-08 14:00:34,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-08 14:00:34,095 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 356 [2019-01-08 14:00:34,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:34,096 INFO L225 Difference]: With dead ends: 366 [2019-01-08 14:00:34,096 INFO L226 Difference]: Without dead ends: 365 [2019-01-08 14:00:34,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 567 SyntacticMatches, 42 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25787 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=22483, Invalid=38279, Unknown=0, NotChecked=0, Total=60762 [2019-01-08 14:00:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-01-08 14:00:34,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2019-01-08 14:00:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-01-08 14:00:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2019-01-08 14:00:34,206 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 356 [2019-01-08 14:00:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:34,206 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2019-01-08 14:00:34,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-08 14:00:34,207 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2019-01-08 14:00:34,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-01-08 14:00:34,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:34,208 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1, 1] [2019-01-08 14:00:34,208 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:00:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:34,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2113380975, now seen corresponding path program 71 times [2019-01-08 14:00:34,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:34,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:34,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:34,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:34,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:37,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:37,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:37,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:37,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:37,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:37,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:37,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:00:37,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:00:37,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-08 14:00:37,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:37,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:37,882 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 6 treesize of output 5 [2019-01-08 14:00:37,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:00:37,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:00:37,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:00:41,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:41,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:46,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:46,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-08 14:00:46,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:46,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-08 14:00:46,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-08 14:00:46,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12575, Invalid=18577, Unknown=0, NotChecked=0, Total=31152 [2019-01-08 14:00:46,077 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 148 states. [2019-01-08 14:00:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:51,410 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-01-08 14:00:51,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-08 14:00:51,410 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 361 [2019-01-08 14:00:51,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:51,412 INFO L225 Difference]: With dead ends: 371 [2019-01-08 14:00:51,412 INFO L226 Difference]: Without dead ends: 370 [2019-01-08 14:00:51,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 575 SyntacticMatches, 44 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26430 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=22763, Invalid=38989, Unknown=0, NotChecked=0, Total=61752 [2019-01-08 14:00:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-08 14:00:51,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2019-01-08 14:00:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-08 14:00:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2019-01-08 14:00:51,563 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 361 [2019-01-08 14:00:51,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:51,563 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2019-01-08 14:00:51,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-08 14:00:51,563 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2019-01-08 14:00:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-01-08 14:00:51,565 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:51,565 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1, 1] [2019-01-08 14:00:51,565 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:00:51,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:51,565 INFO L82 PathProgramCache]: Analyzing trace with hash 804788391, now seen corresponding path program 72 times [2019-01-08 14:00:51,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:51,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:51,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:54,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:54,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:54,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:54,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:54,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:54,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:54,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:00:54,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:00:54,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:00:54,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:54,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:54,744 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 6 treesize of output 5 [2019-01-08 14:00:54,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:00:54,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:00:54,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:00:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:58,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:03,263 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:03,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:03,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-08 14:01:03,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:03,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-08 14:01:03,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-08 14:01:03,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12678, Invalid=18828, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 14:01:03,286 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 150 states. [2019-01-08 14:01:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:08,787 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2019-01-08 14:01:08,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-08 14:01:08,788 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 366 [2019-01-08 14:01:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:08,789 INFO L225 Difference]: With dead ends: 376 [2019-01-08 14:01:08,789 INFO L226 Difference]: Without dead ends: 375 [2019-01-08 14:01:08,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 583 SyntacticMatches, 46 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27075 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=23044, Invalid=39706, Unknown=0, NotChecked=0, Total=62750 [2019-01-08 14:01:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-01-08 14:01:08,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2019-01-08 14:01:08,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-08 14:01:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2019-01-08 14:01:08,911 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 366 [2019-01-08 14:01:08,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:08,911 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2019-01-08 14:01:08,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-08 14:01:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2019-01-08 14:01:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-01-08 14:01:08,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:08,913 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1, 1] [2019-01-08 14:01:08,913 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:01:08,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash 523230033, now seen corresponding path program 73 times [2019-01-08 14:01:08,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:08,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:08,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:08,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:08,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:12,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:12,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:12,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:12,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:12,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:12,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:12,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:12,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:12,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:12,379 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 6 treesize of output 5 [2019-01-08 14:01:12,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:12,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:12,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:01:15,889 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:15,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:20,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:20,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-08 14:01:20,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:20,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-08 14:01:20,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-08 14:01:20,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12781, Invalid=19081, Unknown=0, NotChecked=0, Total=31862 [2019-01-08 14:01:20,535 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 152 states. [2019-01-08 14:01:26,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:26,012 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2019-01-08 14:01:26,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-08 14:01:26,012 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 371 [2019-01-08 14:01:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:26,013 INFO L225 Difference]: With dead ends: 381 [2019-01-08 14:01:26,013 INFO L226 Difference]: Without dead ends: 380 [2019-01-08 14:01:26,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 591 SyntacticMatches, 48 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27722 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=23326, Invalid=40430, Unknown=0, NotChecked=0, Total=63756 [2019-01-08 14:01:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-08 14:01:26,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2019-01-08 14:01:26,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-08 14:01:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-01-08 14:01:26,133 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 371 [2019-01-08 14:01:26,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:26,133 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-01-08 14:01:26,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-08 14:01:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-01-08 14:01:26,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-08 14:01:26,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:26,135 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1, 1] [2019-01-08 14:01:26,135 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:01:26,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1217999591, now seen corresponding path program 74 times [2019-01-08 14:01:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:26,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:26,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:26,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:29,444 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:29,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:29,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:29,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:29,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:29,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:29,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:29,453 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:01:29,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:01:30,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-08 14:01:30,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:30,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:30,189 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 6 treesize of output 5 [2019-01-08 14:01:30,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:30,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:30,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:01:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:33,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:38,745 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:38,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:38,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-08 14:01:38,766 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:38,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-08 14:01:38,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-08 14:01:38,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12884, Invalid=19336, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 14:01:38,768 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 154 states. [2019-01-08 14:01:44,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:44,520 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2019-01-08 14:01:44,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-08 14:01:44,520 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 376 [2019-01-08 14:01:44,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:44,522 INFO L225 Difference]: With dead ends: 386 [2019-01-08 14:01:44,522 INFO L226 Difference]: Without dead ends: 385 [2019-01-08 14:01:44,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 599 SyntacticMatches, 50 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28371 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=23609, Invalid=41161, Unknown=0, NotChecked=0, Total=64770 [2019-01-08 14:01:44,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-01-08 14:01:44,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2019-01-08 14:01:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-08 14:01:44,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2019-01-08 14:01:44,645 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 376 [2019-01-08 14:01:44,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:44,645 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2019-01-08 14:01:44,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-08 14:01:44,645 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2019-01-08 14:01:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-01-08 14:01:44,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:44,647 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1, 1] [2019-01-08 14:01:44,647 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:01:44,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:44,647 INFO L82 PathProgramCache]: Analyzing trace with hash 241510673, now seen corresponding path program 75 times [2019-01-08 14:01:44,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:44,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:44,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:44,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:44,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:47,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:47,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:47,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:47,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:47,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:47,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:47,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:01:47,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:01:48,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:01:48,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:48,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:48,235 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 6 treesize of output 5 [2019-01-08 14:01:48,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:01:48,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:01:48,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:01:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:51,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:56,591 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:56,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:56,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-08 14:01:56,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:56,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-08 14:01:56,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-08 14:01:56,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12987, Invalid=19593, Unknown=0, NotChecked=0, Total=32580 [2019-01-08 14:01:56,615 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 156 states. [2019-01-08 14:02:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:02,772 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-01-08 14:02:02,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-08 14:02:02,772 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 381 [2019-01-08 14:02:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:02,773 INFO L225 Difference]: With dead ends: 391 [2019-01-08 14:02:02,773 INFO L226 Difference]: Without dead ends: 390 [2019-01-08 14:02:02,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 607 SyntacticMatches, 52 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29022 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=23893, Invalid=41899, Unknown=0, NotChecked=0, Total=65792 [2019-01-08 14:02:02,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-01-08 14:02:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2019-01-08 14:02:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-01-08 14:02:02,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2019-01-08 14:02:02,900 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 381 [2019-01-08 14:02:02,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:02,900 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2019-01-08 14:02:02,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-08 14:02:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2019-01-08 14:02:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-01-08 14:02:02,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:02,902 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1, 1] [2019-01-08 14:02:02,902 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:02:02,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:02,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1062108455, now seen corresponding path program 76 times [2019-01-08 14:02:02,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:02,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:02,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:02,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:02,903 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:06,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:06,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:06,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:06,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:06,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:06,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:06,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:06,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:06,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:06,369 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 6 treesize of output 5 [2019-01-08 14:02:06,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:06,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:06,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:02:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:10,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:15,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:15,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-08 14:02:15,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:15,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-08 14:02:15,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-08 14:02:15,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13090, Invalid=19852, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 14:02:15,768 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 158 states. [2019-01-08 14:02:21,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:21,702 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2019-01-08 14:02:21,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-08 14:02:21,703 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 386 [2019-01-08 14:02:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:21,704 INFO L225 Difference]: With dead ends: 396 [2019-01-08 14:02:21,704 INFO L226 Difference]: Without dead ends: 395 [2019-01-08 14:02:21,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 615 SyntacticMatches, 54 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29675 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=24178, Invalid=42644, Unknown=0, NotChecked=0, Total=66822 [2019-01-08 14:02:21,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-01-08 14:02:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2019-01-08 14:02:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-01-08 14:02:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2019-01-08 14:02:21,835 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 386 [2019-01-08 14:02:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:21,835 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2019-01-08 14:02:21,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-08 14:02:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2019-01-08 14:02:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-01-08 14:02:21,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:21,837 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1, 1] [2019-01-08 14:02:21,837 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:02:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:21,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1264302383, now seen corresponding path program 77 times [2019-01-08 14:02:21,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:21,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:21,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:21,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:21,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:25,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:25,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:25,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:25,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:25,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:25,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:25,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:25,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:02:25,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:02:26,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-08 14:02:26,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:26,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:26,130 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 6 treesize of output 5 [2019-01-08 14:02:26,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:26,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:26,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:02:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:30,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:34,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:34,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-08 14:02:34,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:34,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-08 14:02:34,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-08 14:02:34,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13193, Invalid=20113, Unknown=0, NotChecked=0, Total=33306 [2019-01-08 14:02:34,977 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 160 states. [2019-01-08 14:02:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:40,967 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2019-01-08 14:02:40,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-08 14:02:40,967 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 391 [2019-01-08 14:02:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:40,968 INFO L225 Difference]: With dead ends: 401 [2019-01-08 14:02:40,969 INFO L226 Difference]: Without dead ends: 400 [2019-01-08 14:02:40,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 623 SyntacticMatches, 56 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30330 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=24464, Invalid=43396, Unknown=0, NotChecked=0, Total=67860 [2019-01-08 14:02:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-01-08 14:02:41,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2019-01-08 14:02:41,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-08 14:02:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-01-08 14:02:41,102 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 391 [2019-01-08 14:02:41,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:41,102 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-01-08 14:02:41,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-08 14:02:41,103 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-01-08 14:02:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-01-08 14:02:41,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:41,104 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1, 1] [2019-01-08 14:02:41,104 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:02:41,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1822160743, now seen corresponding path program 78 times [2019-01-08 14:02:41,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:41,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:41,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:41,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:44,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:44,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:44,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:44,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:44,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:44,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:44,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:02:44,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:02:44,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:02:44,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:45,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:45,013 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 6 treesize of output 5 [2019-01-08 14:02:45,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:02:45,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:02:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:49,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:53,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:53,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-08 14:02:53,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:53,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-08 14:02:53,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-08 14:02:53,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13296, Invalid=20376, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 14:02:53,674 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 162 states. [2019-01-08 14:02:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:59,909 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2019-01-08 14:02:59,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-08 14:02:59,910 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 396 [2019-01-08 14:02:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:59,911 INFO L225 Difference]: With dead ends: 406 [2019-01-08 14:02:59,911 INFO L226 Difference]: Without dead ends: 405 [2019-01-08 14:02:59,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 631 SyntacticMatches, 58 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30987 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=24751, Invalid=44155, Unknown=0, NotChecked=0, Total=68906 [2019-01-08 14:02:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-01-08 14:03:00,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2019-01-08 14:03:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-01-08 14:03:00,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2019-01-08 14:03:00,049 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 396 [2019-01-08 14:03:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:00,049 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2019-01-08 14:03:00,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-08 14:03:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2019-01-08 14:03:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-01-08 14:03:00,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:00,051 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1, 1] [2019-01-08 14:03:00,051 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:03:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:00,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1810445457, now seen corresponding path program 79 times [2019-01-08 14:03:00,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:00,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:00,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:00,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:00,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:03,428 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:03,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:03,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:03,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:03,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:03,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:03,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:03,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:03,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:03,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:03,712 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 6 treesize of output 5 [2019-01-08 14:03:03,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:03,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:03,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:03:07,985 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:07,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:12,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:12,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-08 14:03:12,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:12,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-08 14:03:12,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-08 14:03:12,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13399, Invalid=20641, Unknown=0, NotChecked=0, Total=34040 [2019-01-08 14:03:12,770 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 164 states. [2019-01-08 14:03:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:18,864 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2019-01-08 14:03:18,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-08 14:03:18,864 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 401 [2019-01-08 14:03:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:18,866 INFO L225 Difference]: With dead ends: 411 [2019-01-08 14:03:18,866 INFO L226 Difference]: Without dead ends: 410 [2019-01-08 14:03:18,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 639 SyntacticMatches, 60 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31646 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=25039, Invalid=44921, Unknown=0, NotChecked=0, Total=69960 [2019-01-08 14:03:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-08 14:03:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2019-01-08 14:03:19,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-01-08 14:03:19,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2019-01-08 14:03:19,000 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 401 [2019-01-08 14:03:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:19,001 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2019-01-08 14:03:19,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-08 14:03:19,001 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2019-01-08 14:03:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-01-08 14:03:19,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:19,002 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1, 1] [2019-01-08 14:03:19,003 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:03:19,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:19,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1409655207, now seen corresponding path program 80 times [2019-01-08 14:03:19,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:19,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:19,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:19,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:19,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:22,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:22,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:22,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:22,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:22,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:22,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:22,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:22,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:23,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-08 14:03:23,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:23,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:23,388 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 6 treesize of output 5 [2019-01-08 14:03:23,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:23,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:23,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:03:27,724 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:27,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:32,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:32,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-08 14:03:32,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:32,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-08 14:03:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-08 14:03:32,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13502, Invalid=20908, Unknown=0, NotChecked=0, Total=34410 [2019-01-08 14:03:32,486 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 166 states. [2019-01-08 14:03:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:39,140 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2019-01-08 14:03:39,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-08 14:03:39,140 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 406 [2019-01-08 14:03:39,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:39,142 INFO L225 Difference]: With dead ends: 416 [2019-01-08 14:03:39,142 INFO L226 Difference]: Without dead ends: 415 [2019-01-08 14:03:39,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 647 SyntacticMatches, 62 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32307 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=25328, Invalid=45694, Unknown=0, NotChecked=0, Total=71022 [2019-01-08 14:03:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-01-08 14:03:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2019-01-08 14:03:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-01-08 14:03:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2019-01-08 14:03:39,287 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 406 [2019-01-08 14:03:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:39,288 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2019-01-08 14:03:39,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-08 14:03:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2019-01-08 14:03:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-01-08 14:03:39,289 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:39,290 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1, 1] [2019-01-08 14:03:39,290 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:03:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1127215697, now seen corresponding path program 81 times [2019-01-08 14:03:39,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:39,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:39,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:39,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:43,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:43,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:43,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:43,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:43,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:43,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:43,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:43,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:03:43,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:03:43,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:03:43,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:43,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:43,458 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 6 treesize of output 5 [2019-01-08 14:03:43,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:03:43,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:03:43,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:03:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:48,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:52,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:52,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-08 14:03:52,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:52,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-08 14:03:52,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-08 14:03:52,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13605, Invalid=21177, Unknown=0, NotChecked=0, Total=34782 [2019-01-08 14:03:52,791 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 168 states. [2019-01-08 14:03:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:59,313 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2019-01-08 14:03:59,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-08 14:03:59,313 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 411 [2019-01-08 14:03:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:59,315 INFO L225 Difference]: With dead ends: 421 [2019-01-08 14:03:59,315 INFO L226 Difference]: Without dead ends: 420 [2019-01-08 14:03:59,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 655 SyntacticMatches, 64 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32970 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=25618, Invalid=46474, Unknown=0, NotChecked=0, Total=72092 [2019-01-08 14:03:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-01-08 14:03:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2019-01-08 14:03:59,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-01-08 14:03:59,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2019-01-08 14:03:59,464 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 411 [2019-01-08 14:03:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:59,465 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2019-01-08 14:03:59,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-08 14:03:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2019-01-08 14:03:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-01-08 14:03:59,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:59,467 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1, 1] [2019-01-08 14:03:59,467 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:03:59,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash -468747289, now seen corresponding path program 82 times [2019-01-08 14:03:59,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:59,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:59,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:59,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:03,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:03,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:03,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:03,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:03,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:03,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:03,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:03,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:04:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:03,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:03,841 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 6 treesize of output 5 [2019-01-08 14:04:03,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:03,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:03,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:04:08,470 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:08,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:13,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:13,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-08 14:04:13,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:13,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-08 14:04:13,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-08 14:04:13,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13708, Invalid=21448, Unknown=0, NotChecked=0, Total=35156 [2019-01-08 14:04:13,246 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 170 states. [2019-01-08 14:04:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:19,796 INFO L93 Difference]: Finished difference Result 426 states and 426 transitions. [2019-01-08 14:04:19,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-08 14:04:19,797 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 416 [2019-01-08 14:04:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:19,798 INFO L225 Difference]: With dead ends: 426 [2019-01-08 14:04:19,798 INFO L226 Difference]: Without dead ends: 425 [2019-01-08 14:04:19,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 663 SyntacticMatches, 66 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33635 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=25909, Invalid=47261, Unknown=0, NotChecked=0, Total=73170 [2019-01-08 14:04:19,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-01-08 14:04:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2019-01-08 14:04:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-01-08 14:04:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2019-01-08 14:04:19,952 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 416 [2019-01-08 14:04:19,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:19,953 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2019-01-08 14:04:19,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-08 14:04:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2019-01-08 14:04:19,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-01-08 14:04:19,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:19,955 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1, 1] [2019-01-08 14:04:19,955 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:04:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:19,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1099661295, now seen corresponding path program 83 times [2019-01-08 14:04:19,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:19,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:19,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:24,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:24,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:24,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:24,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:24,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:24,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:24,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:24,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:25,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-08 14:04:25,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:25,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:25,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 6 treesize of output 5 [2019-01-08 14:04:25,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:25,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:25,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:04:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:29,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:34,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:34,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-08 14:04:34,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:34,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-08 14:04:34,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-08 14:04:34,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13811, Invalid=21721, Unknown=0, NotChecked=0, Total=35532 [2019-01-08 14:04:34,721 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 172 states. [2019-01-08 14:04:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:41,760 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2019-01-08 14:04:41,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-08 14:04:41,760 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 421 [2019-01-08 14:04:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:41,762 INFO L225 Difference]: With dead ends: 431 [2019-01-08 14:04:41,762 INFO L226 Difference]: Without dead ends: 430 [2019-01-08 14:04:41,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 671 SyntacticMatches, 68 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34302 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=26201, Invalid=48055, Unknown=0, NotChecked=0, Total=74256 [2019-01-08 14:04:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-01-08 14:04:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2019-01-08 14:04:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-08 14:04:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2019-01-08 14:04:41,921 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 421 [2019-01-08 14:04:41,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:41,922 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2019-01-08 14:04:41,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-08 14:04:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2019-01-08 14:04:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-01-08 14:04:41,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:41,925 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1, 1] [2019-01-08 14:04:41,925 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-08 14:04:41,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:41,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1237481945, now seen corresponding path program 84 times [2019-01-08 14:04:41,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:41,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:04:41,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:41,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:45,735 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:45,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:45,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:45,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:45,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:45,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:45,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:45,744 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:04:45,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:04:46,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:04:46,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:46,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:46,067 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 6 treesize of output 5 [2019-01-08 14:04:46,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-08 14:04:46,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-08 14:04:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:50,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:55,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:55,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 189 [2019-01-08 14:04:55,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:55,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-08 14:04:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-08 14:04:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13914, Invalid=21996, Unknown=0, NotChecked=0, Total=35910 [2019-01-08 14:04:55,643 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 174 states.